Additive spanners and distance and routing labeling schemes for hyperbolic graphs

Algorithmica

Volumn 62, Issue 3-4, 2012, Pages 713-732

  Chepoi, Victor ^a   Dragan, Feodor F ^b   Estellon, Bertrand ^a   Habib, Michel ^c   Vaxès, Yann ^a   Xiang, Yang ^d  

^a AIX MARSEILLE UNIVERSITY   (France)

^b KENT STATE UNIVERSITY   (United States)

^c UNIVERSITÉ PARIS DIDEROT   (France)

^d OHIO STATE UNIVERSITY   (United States)

Author keywords

Additive spanners; Algorithms; Distance and routing labeling schemes; hyperbolic graphs

Indexed keywords

ALGORITHMS; FORESTRY; GRAPHIC METHODS; GROUP THEORY; TREES (MATHEMATICS);

ADDITIVE ERRORS; ADDITIVE SPANNERS; CONSTANT TIME; DISTANCE LABELING SCHEMES; GEOMETRIC GROUP THEORY; HYPERBOLIC GRAPHS; LABELING SCHEME; METRIC SPACES;

GRAPH THEORY;

EID: 78650347010     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-010-9478-x     Document Type: Article

References (59)

1. Abraham, I., Gavoille, C.: Object location using path separators. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing (PODC 2006), Denver, Colorado, USA, 23-26 July 2006, pp. 188-197. ACM, New York (2006)
2. Abraham, I., Gavoille, C., Goldberg, A.V., Malkhi, D.: Routing in networks with low doubling dimension. In: Proceedings of 26th International Conference on Distributed Computing Systems (ICDCS 2006), p. 75. IEEE Comput. Soc., Los Alamitos (2006)
3. Abraham, I., Balakrishnan, M., Kuhn, F., Malkhi, D., Ramasubramanian, V., Talwar, K.: Reconstructing approximate tree metrics. In: Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing (PODC 2007), Portland, Oregon, USA, 12-15 August 2007, pp. 43-52. ACM, New York (2007)
4. Alonso, J.M., Brady, T., Cooper, D., Ferlini, V., Lustig, M., Mihalik, M., Shapiro, M., Short, H.: Notes on word hyperbolic groups. In: Ghys, E., Haefliger, A., Verjovsky, A. (eds.) Group Theory from a Geometrical Viewpoint, ICTP Trieste 1990, pp. 3-63. World Scientific, Singapore (1991)
5. Alstrup, S., Bille, P., Rauhe, T.: Labeling schemes for small distances in trees. SIAM J. Discrete Math. 19, 448-462 (2005)
6. Alvarez, V., Portilla, A., Rodriguez, J.M., Touris, E.: Gromov hyperbolicity of Denjoy domains. Geom. Dedic. 121, 221-245 (2006)
7. Bǎdoiu, M., Indyk, P., Sidiropoulos, A.: Approximation algorithms for embedding general metrics into trees. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), New Orleans, Louisiana, USA, 7-9 January 2007, pp. 512-521. SIAM, Philadelphia (2007)
8. Bandelt, H.-J., Chepoi, V.: 1-Hyperbolic graphs. SIAM J. Discrete Math. 16, 323-334 (2003)
9. Bazzaro, F., Gavoille, C.: Localized and compact data-structure for comparability graphs. Discrete Math. 309, 3465-3484 (2009)
10. Brandstädt, A., Chepoi, V., Dragan, F.: Distance approximating trees for chordal and dually chordal graphs. J. Algorithms 30, 166-184 (1999)
11. Bridson, M., Haefliger, A.: Metric Spaces of Non-Positive Curvature. Springer, Berlin (1999)
12. Chan, H.T.-H., Gupta, A., Maggs, B.M., Zhou, S.: On hierarchical routing in doubling metrics. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), Vancouver, British Columbia, Canada, 23-25 January 2005, pp. 762-771. SIAM, Philadelphia (2005)
13. Chepoi, V., Dragan, F.: A note on distance approximating trees in graphs. Eur. J. Comb.21, 761-766 (2000)
14. Chepoi, V., Estellon, B.: Packing and covering δ-hyperbolic spaces by balls. In: Proceedings of Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, 20-22 August 2007. Lecture Notes in Computer Science, vol. 4627, pp. 59-73. Springer, Berlin (2007)
15. Chepoi, V., Dragan, F.F., Yan, C.: Additive sparse spanners for graphs with bounded length of largest induced cycle. Theor. Comput. Sci. 347, 54-75 (2005)
16. Chepoi, V., Dragan, F., Vaxès, Y.: Distance and routing labeling schemes for non-positively curved plane graphs. J. Algorithms 61, 60-88 (2006)
17. Chepoi, V., Dragan, F.F., Estellon, B., Habib, M., Vaxès, Y.: Diameters, centers, and approximating trees of δ-hyperbolic geodesic spaces and graphs. In: Proceedings of the 24th Annual ACM Symposium on Computational Geometry (SoCG 2008), 9-11 June 2008, College Park, Maryland, USA, pp. 59-68 (2008)
18. Courcelle, B., Vanicat, R.: Query efficient implementation of graphs of bounded clique-width. Discrete Appl. Math. 131, 129-150 (2003)
19. Cowen, L.: Compact Routing with Minimum Stretch. J. Algorithms 38, 170-183 (2001)
20. Dourisboure, Y.: Compact routing schemes for generalised chordal graphs. J. Graph Algorithms Appl. 9, 277-297 (2005)
21. Dourisboure, Y., Gavoille, C.: Tree-decompositions with bags of small diameter. Discrete Math. 307, 208-229 (2007)
22. Dourisboure, Y., Dragan, F.F., Gavoille, C., Yan, C.: Spanners for bounded tree-length graphs. Theor. Comput. Sci. 383, 34-44 (2007)
23. Dragan, F.F., Yan, C.: Collective tree spanners in graphs with bounded parameters. Algorithmica 57, 22-43 (2010)
24. Dragan, F.F., Yan, C., Corneil, D.G.: Collective tree spanners and routing in AT-free related graphs. J. Graph Algorithms Appl. 10, 97-122 (2006)
25. Dragan, F.F., Yan, C., Lomonosov, I.: Collective tree spanners of graphs. SIAM J. Discrete Math. 20, 241-260 (2006)
26. Eilam, T., Gavoille, C., Peleg, D.: Compact routing schemes with low stretch factor. J. Algorithms 46, 97-114 (2003)
27. Fraigniaud, P., Gavoille, C.: Routing in trees. In: Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP 2001), Crete, Greece, 8-12 July 2001. Lecture Notes in Computer Science, vol. 2076, pp. 757-772. Springer, Berlin (2001)
28. Gavoille, C., Gengler, M.: Space-efficiency of routing schemes of stretch factor three. J. Parallel Distrib. Comput. 61, 679-687 (2001)
29. Gavoille, C., Hanusse, N.: Compact routing tables for graphs of bounded genus. In: Proceedings of the 26th International Colloquium on Automata, Languages and Programming (ICALP’99), Prague, Czech Republic, 11-15 July 1999. Lecture Notes in Computer Science, vol. 1644, pp. 351-360. Springer, Berlin (1999)
30. Gavoille, C., Ly, O.: Distance labeling in hyperbolic graphs. In: Proceedings of 16th International Symposium on Algorithms and Computation (ISAAC 2005), Sanya, Hainan, China, 19-21 December 2005. Lecture Notes in Computer Science, vol. 3827, pp. 171-179. Springer, Berlin (2005)
31. Gavoille, C., Paul, C.: Distance labeling scheme and split decomposition. Discrete Math.273, 115-130 (2003)
32. Gavoille, C., Paul, C.: Optimal distance labeling for interval graphs and related graph families. SIAM J. Discrete Math. 22, 1239-1258 (2008)
33. Gavoille, C., Peleg, D.: Compact and localized distributed data structures. Distrib. Comput. 16, 111-120 (2003)
34. Gavoille, C., Pérennès, S.: Memory requirements for routing in distributed networks. In: Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing (PODC 1996), Philadelphia, Pennsylvania, USA, 23-26 May 1996, pp. 125-133. ACM, New York (1996)
35. Gavoille, C., Katz, M., Katz, N.A., Paul, C., Peleg, D.: Approximate distance labeling schemes. In: Proceedings of the 9th Annual European Symposium on Algorithms (ESA 2001), Aarhus, Denmark, 28-31 August 2001. Lecture Notes in Computer Science, vol. 2161, pp. 476-488. Springer, Berlin (2001)
36. Gavoille, C., Peleg, D., Pérennès, S., Raz, R.: Distance labeling in graphs. J. Algorithms53, 85-112 (2004)
37. Ghys, E., de la Harpe, P. (eds.): Les Groupes Hyperboliques d’Après M. Gromov. Progress in Mathematics, vol. 83. Birkhäuser, Basel (1990)
38. Gromov, M.: Hyperbolic Groups. In: Gersten, S.M. (ed.) Essays in Group Theory. MSRI Series, vol. 8, pp. 75-263 (1987)
39. Gupta, A., Krauthgamer, R., Lee, J.R.: Bounded geometries, fractals, and low-distortion embeddings. In: Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), Cambridge, MA, USA, 11-14 October 2003, pp. 534-543. IEEE Comput. Soc., Los Alamitos (2003)
40. Gupta, A., Kumar, A., Rastogi, R.: Traveling with a pez dispenser (or, routing issues in mpls). SIAM J. Comput. 34, 453-474 (2005)
41. Har-Peled, S., Mendel, M.: Fast construction of nets in low dimensional metrics, and their applications, fast construction of nets in low-dimensional metrics and their applications. SIAM J. Comput. 35, 1148-1184 (2006)
42. Karlsson, A., Noskov, G.: The Hilbert metric and Gromov hyperbolicity. Enseign. Math. 48, 73-89 (2002)
43. Klein, P., Plotkin, S.A., Rao, S.: Excluded minors, network decomposition, and multicommodity flow. In: Proceedings of the 25th Annual ACM Symposium on Theory of Computing (STOC 1993), pp. 682-690. ACM, New York (1993)
44. Kleinberg, R.: Geographic routing using hyperbolic space. In: Proceedings of the 26th IEEE International Conference on Computer Communications (INFOCOM 2007), Anchorage, Alaska, USA, 6-12 May 2007, pp. 1902-1909. IEEE Press, New York (2007)
45. Konjevod, G., Richa, A.W., Xia, D.: Optimal-stretch name-independent compact routing in doubling metrics. In: Proceedings of the 25th Annual ACM Symposium on Principles of Distributed Computing (PODC 2006), Denver, CO, USA, 23-26 July 2006, pp. 198-207. ACM, New York (2006)
46. Konjevod, G., Richa, A.W., Xia, D.: Optimal scale-free compact routing schemes in networks of low doubling dimension. In: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), New Orleans, Louisiana, USA, 7-9 January 2007, pp. 939-948. SIAM, Philadelphia (2007)
47. Konjevod, G., Richa, A., Xia, D., Yu, H.: Compact routing with slack in low doubling dimension. In: Proceedings of the 26th Annual ACM Symposium on Principles of Distributed Computing (PODC 2007), Portland, Oregon, USA, 12-15 August 2007, pp. 71-80. ACM, New York (2007)
48. Konjevod, G., Richa, A.W., Xia, D.: Dynamic routing and location services in metrics of low doubling dimension. In: Proceedings of the 22nd International Symposium on Distributed Computing (DISC 2008), Arcachon, France, 22-24 September 2008, Lecture Notes in Computer Science, vol. 5218, pp. 379-393. Springer, Berlin (2008)
49. Koolen, J., Moulton, V.: Hyperbolic bridged graphs. Eur. J. Comb. 23, 683-699 (2002)
50. Krauthgamer, R., Lee, J.R.: Algorithms on negatively curved spaces. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), Berkeley, California, USA, 21-24 October 2006, pp. 119-132. IEEE Comput. Soc., Los Alamitos (2006)
51. Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM Monographs on Discrete Math. Appl. SIAM, Philadelphia (2000)
52. Peleg, D.: Proximity-preserving labeling schemes and their applications. J. Graph Theory 33, 167-176 (2000)
53. Shavitt, Y., Tankel, T.: Hyperbolic embedding of internet graph for distance estimation and overlay construction. IEEE/ACM Trans. Netw. 16, 25-36 (2008)
54. Slivkins, A.: Distributed approaches to triangulation and embedding. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), Vancouver, British Columbia, Canada, 23-25 January 2005, pp. 640-649. SIAM, New York (2005)
55. Slivkins, A.: Distance estimation and object location via rings of neighbors. Distrib. Comput. 19, 313-333 (2007)
56. Talwar, K.: Bypassing the embedding: algorithms for low dimensional metrics. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC 2004), Chicago, IL, USA, 13-16 June 2004, pp. 281-290. ACM, New York (2004)
57. Thorup, M.: Compact oracles for reachability and approximate distances in planar digraphs. J. Assoc. Comput. Mach. 51, 993-1024 (2004)
58. Thorup, M., Zwick, U.: Compact routing schemes. In: Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 2001), Heraklion, Crete, Greece, 4-6 July 2001, pp. 1-10. ACM, New York (2001)
59. Thorup, M., Zwick, U.: Approximate distance oracles. J. Assoc. Comput. Mach. 52, 1-24 (2005)