Packing and Covering delta -Hyperbolic Spaces by Balls

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, haverecently become of interest in several domains of computer science.Specifically, given a subset Sof aΔ-hyperbolic graph Gand a positive numberR, let Δ(S,R) be theminimum number of balls of radius Rcovering S.It is known that computing Δ(S,R)or approximating this number within a constant factor is hard evenfor 2-hyperbolic graphs. In this paper, using a primal-dualapproach, we show how to construct in polynomial time a covering ofSwith at most Δ(S,R)balls of (slightly larger) radius R+ Δ.This result is established in the general framework ofΔ-hyperbolic geodesic metric spaces and is extendedto some other set families derived from balls. The coveringalgorithm is used to design better approximation algorithms for theaugmentation problem with diameter constraints and for thek-center problem in Δ-hyperbolicgraphs.

[1]  Victor Chepoi,et al.  Mixed Covering of Trees and the Augmentation Problem with Odd Diameter Constraints , 2005, Algorithmica.

[2]  Erik D. Demaine,et al.  Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs , 2005, TALG.

[3]  Reuven Bar-Yehuda,et al.  Scheduling split intervals , 2002, SODA '02.

[4]  Feodor F. Dragan,et al.  A Note on Distance Approximating Trees in Graphs , 2000, Eur. J. Comb..

[5]  Feodor F. Dragan,et al.  Distance Approximating Trees for Chordal and Dually Chordal Graphs , 1999, J. Algorithms.

[6]  Sanjeev Khanna,et al.  Design networks with bounded pairwise distance , 1999, STOC '99.

[7]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[8]  Yuval Shavitt,et al.  Hyperbolic embedding of internet graph for distance estimation and overlay construction , 2008, TNET.

[9]  Hans-Jürgen Bandelt,et al.  1-Hyperbolic Graphs , 2003, SIAM J. Discret. Math..

[10]  Paul Erdös,et al.  How to decrease the diameter of triangle-free graphs , 1998, Comb..

[11]  Robert D. Kleinberg.  Geographic Routing Using Hyperbolic Space , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[12]  G. Nemhauser,et al.  The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs , 1984 .

[13]  David Eppstein,et al.  Squarepants in a tree: sum of subtree clustering and hyperbolic pants decomposition , 2006, SODA '07.

[14]  Tomás Feder,et al.  Optimal algorithms for approximate clustering , 1988, STOC '88.

[15]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .

[16]  David B. Shmoys,et al.  A unified approach to approximation algorithms for bottleneck problems , 1986, JACM.

[17]  Chung-Lun Li,et al.  On the minimum-cardinality-bounded-diameter and the bounded-cardinality-minimum-diameter edge addition problems , 1992, Oper. Res. Lett..

[18]  Noga Alon,et al.  Decreasing the diameter of bounded degree graphs , 2000 .

[19]  Olivier Ly,et al.  Distance Labeling in Hyperbolic Graphs , 2005, ISAAC.

[20]  Martin Farber,et al.  Domination, independent domination, and duality in strongly chordal graphs , 1984, Discret. Appl. Math..

[21]  Noga Alon,et al.  Piercing d -Intervals , 1998, Discret. Comput. Geom..

[22]  Fan Chung Graham,et al.  Diameter bounds for altered graphs , 1984, J. Graph Theory.

[23]  Erik D. Demaine,et al.  Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs , 2003, ICALP.

[24]  Noga Alon,et al.  Algorithmic construction of sets for k-restrictions , 2006, TALG.

[25]  Laurence A. Wolsey,et al.  Packing and covering a tree by subtrees , 1986, Comb..

[26]  Gerard J. Chang.  Labeling algorithms for domination problems in sun-free chordal graphs , 1988, Discret. Appl. Math..

[27]  Amos Fiat.  Some Issues Regarding Search, Censorship, and Anonymity in Peer to Peer Networks , 2003, ICALP.

[28]  Victor Chepoi,et al.  Covering Planar Graphs with a Fixed Number of Balls , 2007, Discret. Comput. Geom..

[29]  R. Chandrasekaran,et al.  Location on Tree Networks: P-Centre and n-Dispersion Problems , 1981, Math. Oper. Res..

[30]  Noga Alon.  Covering a hypergraph of subgraphs , 2002, Discret. Math..

[31]  Jacobus H. Koolen,et al.  Hyperbolic Bridged Graphs , 2002, Eur. J. Comb..

[32]  H. Short,et al.  Notes on word hyperbolic groups , 1991 .

[33]  Victor Chepoi,et al.  Augmenting Trees to Meet Biconnectivity and Diameter Constraints , 2002, Algorithmica.

[34]  Feodor F. Dragan,et al.  Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs , 1997, SIAM J. Discret. Math..

[35]  Hiroshi Nagamochi,et al.  Augmenting forests to meet odd diameter requirements , 2006, Discret. Optim..

[36]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[37]  Jan van Leeuwen,et al.  Diameter increase caused by edge deletion , 1987, J. Graph Theory.

[38]  Dorit S. Hochbaum,et al.  Various notions of approximations: good, better, best, and more , 1996 .

[39]  Robert Krauthgamer,et al.  Algorithms on negatively curved spaces , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[40]  D. Eppstein,et al.  Approximation algorithms for geometric problems , 1996 .