Approximation algorithms for the gromov hyperbolicity of discrete metric spaces

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 8392 LNCS, Issue , 2014, Pages 285-293

  Duan, Ran ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION SCIENCE; SET THEORY; TOPOLOGY;

EXACT SOLUTION; HYPERBOLICITY; MATRIX MULTIPLICATION; METRIC SPACES; RUNNING TIME; TIME ALGORITHMS; TIME COMPLEXITY;

APPROXIMATION ALGORITHMS;

EID: 84899910992     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-54423-1_25     Document Type: Conference Paper

References (12)

1. Bonk, M., Schramm, O.: Embeddings of Gromov hyperbolic spaces. Geom. Funct. Anal. 10, 266-306 (2000)
2. Chen, W., Fang, W., Hu, G., Mahoney, M.W.: On the hyperbolicity of small-world and tree-like random graphs. In: Chao, K.-M., Hsu, T.-s., Lee, D.-T. (eds.) ISAAC 2012. LNCS, vol. 7676, pp. 278-288. Springer, Heidelberg (2012)
3. Chepoi, V., Dragan, F.F., Estellon, B., Habib, M., Vaxès, Y., Xiang, Y.: Additive spanners and distance and routing labeling schemes for hyperbolic graphs. Algorithmica 62(3-4), 713-732 (2012)
4. Coppersmith, D.: Rectangular matrix multiplication revisited. J. Complex. 13(1), 42-49 (1997)
5. Coppersmith, D., Winograd, T.: Matrix multiplication via arithmetic progressions. In: Proc. 19th ACM Symp. on the Theory of Computing (STOC), pp. 1-6 (1987)
6. Duan, R., Pettie, S.: Fast algorithms for (max, min)-matrix multiplication and bottleneck shortest paths. In: SODA 2009: Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 384-391. Society for Industrial and Applied Mathematics, Philadelphia (2009)
7. Fournier, H., Ismail, A., Vigneron, A.: Computing the Gromov hyperbolicity of a discrete metric space. CoRR, abs/1210.3323 (2012)
8. Gavoille, C., Ly, O.: Distance labeling in hyperbolic graphs. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol. 3827, pp. 1071-1079. Springer, Heidelberg (2005)
9. Gromov, M.: Hyperbolic groups. In: Gersten, S. (ed.) Essays in Group Theory. Mathematical Sciences Research Institute Publications, vol. 8, pp. 75-263. Springer, New York (1987)
10. Krioukov, D.V., Papadopoulos, F., Kitsak, M., Vahdat, A., Bogu, M.: Hyperbolic geometry of complex networks. CoRR, abs/1006.5169 (2010)
11. Williams, V.V.: Multiplying matrices faster than Coppersmith-Winograd. In: Proceedings of the 44th Symposium on Theory of Computing, STOC 2012, pp. 887-898. ACM, New York (2012)
12. Zwick, U.: All pairs shortest paths using bridging sets and rectangular matrix multiplication. J. ACM 49(3), 289-317 (2002)