Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A Survey of Fractal Dimensions of NetworksLower Bounds on Box Counting

A Survey of Fractal Dimensions of Networks: Lower Bounds on Box Counting [Consider a box counting heuristic using radius-based boxes, e.g., Maximum Excluded Mass Burning. There is no guarantee that the computed is minimal or even near minimal.] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

A Survey of Fractal Dimensions of NetworksLower Bounds on Box Counting

Part of the SpringerBriefs in Computer Science Book Series
Rosenberg, Eric
Springer Journals — May 30, 2018
Download PDF
8 pages

Loading next page...
 
/lp/springer-journals/a-survey-of-fractal-dimensions-of-networks-lower-bounds-on-box-pmKnGw8cjb
Publisher
Springer International Publishing
Copyright
© The Author(s), under exclusive licence to Springer International Publishing AG, part of Springer Nature 2018
ISBN
978-3-319-90046-9
Pages
29 –37
DOI
10.1007/978-3-319-90047-6_4
Publisher site
See Chapter on Publisher Site

Abstract

[Consider a box counting heuristic using radius-based boxes, e.g., Maximum Excluded Mass Burning. There is no guarantee that the computed is minimal or even near minimal.]

Published: May 30, 2018

Keywords: Lower Bound; Uncapacitated Facility Location Problem (UFLP); Dual Ascent; Optimal Objective Function Value; Dual Adjustment

There are no references for this article.