A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf
.
Packing and Covering δ-Hyperbolic Spaces by Balls
[chapter]
2007
Lecture Notes in Computer Science
We consider the problem of covering and packing subsets of δ-hyperbolic metric spaces and graphs by balls. These spaces, defined via a combinatorial Gromov condition, have recently become of interest in several domains of computer science. Specifically, given a subset S of a δhyperbolic graph G and a positive number R, let γ(S, R) be the minimum number of balls of radius R covering S. It is known that computing γ(S, R) or approximating this number within a constant factor is hard even for
doi:10.1007/978-3-540-74208-1_5
fatcat:w4kjwnfjjveppht6iu7o7tdvyu