Packing and Covering δ-Hyperbolic Spaces by Balls
From MaRDI portal
Publication:3603456
DOI10.1007/978-3-540-74208-1_5zbMath1171.05315OpenAlexW1487479819MaRDI QIDQ3603456
Bertrand Estellon, Victor Chepoi
Publication date: 17 February 2009
Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-74208-1_5
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Approximation algorithms (68W25) Combinatorial aspects of packing and covering (05B40)
Related Items (34)
Packing and covering with balls on Busemann surfaces ⋮ The hyperbolicity constant of infinite circulant graphs ⋮ Characterization of the hyperbolicity in the lexicographic product ⋮ Obstructions to a small hyperbolicity in Helly graphs ⋮ Data center interconnection networks are not hyperbolic ⋮ On Computing the Hyperbolicity of Real-World Graphs ⋮ Computing the hyperbolicity constant of a cubic graph ⋮ Helly-gap of a graph and vertex eccentricities ⋮ Fast approximation and exact computation of negative curvature parameters of graphs ⋮ Gromov hyperbolicity of planar graphs ⋮ Why did the shape of your network change? (On detecting network anomalies via non-local curvatures) ⋮ Injective metrics on buildings and symmetric spaces ⋮ On the hyperbolicity of random graphs ⋮ A story of diameter, radius, and (almost) Helly property ⋮ Distance problems within Helly graphs and \(k\)-Helly graphs ⋮ Coarse injectivity, hierarchical hyperbolicity and semihyperbolicity ⋮ Additive spanners and distance and routing labeling schemes for hyperbolic graphs ⋮ Effect of Gromov-hyperbolicity parameter on cuts and expansions in graphs and some algorithmic implications ⋮ Characterization of Gromov hyperbolic short graphs ⋮ Gromov hyperbolicity of periodic planar graphs ⋮ Gromov hyperbolicity in lexicographic product graphs ⋮ A review of two network curvature measures ⋮ Hyperbolicity in the corona and join of graphs ⋮ Gromov hyperbolicity and convex tessellation graph ⋮ Hyperbolicity in median graphs ⋮ To Approximate Treewidth, Use Treelength! ⋮ Parameterized approximation algorithms for some location problems in graphs ⋮ Gromov hyperbolicity of periodic graphs ⋮ Fast approximation algorithms for \(p\)-centers in large \(\delta\)-hyperbolic graphs ⋮ Fast approximation of eccentricities and distances in hyperbolic graphs ⋮ Kirszbraun-type theorems for graphs ⋮ Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs ⋮ Fellow travelers phenomenon present in real-world networks ⋮ Computing the Gromov hyperbolicity of a discrete metric space
This page was built for publication: Packing and Covering δ-Hyperbolic Spaces by Balls
