Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs

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

Volumn 6302 LNCS, Issue , 2010, Pages 95-109

  Chepoi, Victor ^a   Dragan, Feodor F ^b   Newman, Ilan ^c   Rabinovich, Yuri ^c   Vaxès, Yann ^a  

^a AIX MARSEILLE UNIV   (France)

^b KENT STATE UNIVERSITY   (United States)

^c UNIVERSITY OF HAIFA   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 78149337400     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15369-3_8     Document Type: Conference Paper

References (17)

1. Agarwala, R., Bafna, V., Farach, M., Narayanan, B., Paterson, M., Thorup, M.: On the approximability of numerical taxonomy (fitting distances by tree metrics). SIAM J. Comput. 28 (1999)
2. Bǎdoiu, M., Chuzhoy, J., Indyk, P., Sidiropoulos, A.: Low-distortion embeddings of general metrics into the line. In: STOC 2005 (2005)
3. Bǎdoiu, M., Demaine, E.D., Hajiaghayi, M.T., Sidiropoulos, A., Zadimoghaddam, M.: Ordinal embedding: approximation algorithms and dimensionality reduction. In: APPROX-RANDOM 2008 (2008)
4. Bǎdoiu, M., Indyk, P., Sidiropoulos, A.: Approximation algorithms for embedding general metrics into trees. In: SODA 2007 (2007)
5. Brandstädt, A., Chepoi, V., Dragan, F.: Distance approximating trees for chordal and dually chordal graphs. J. Algorithms 30 (1999)
6. Chepoi, V., Dragan, F.: A note on distance approximating trees in graphs. Europ. J. Combin. 21 (2000)
7. Chepoi, V., Dragan, F., Estellon, B., Habib, M., Vaxès, Y.: Diameters, centers, and approximating trees of δ-hyperbolic geodesic spaces and graphs. In: SoCG 2008 (2008)
8. ∞-Approximation via subdominants. J. Math. Psychol. 44 (2000)
9. Dourisboure, Y., Dragan, F.F., Gavoille, C., Yan, C.: Spanners for bounded tree-length graphs. Theor. Comput. Sci. 383 (2007)
10. Dourisboure, Y., Gavoille, C.: Tree-decompositions with bags of small diameter. Discr. Math. 307 (2007)
11. Emek, Y., Peleg, D.: Approximating minimum max-stretch spanning trees on unweighted graphs. In: SODA 2004 (2004)
12. Gupta, A.: Steiner points in tree metrics don't (really) help. In: SODA 2001 (2001)
13. Indyk, P., Matousek, J.: Low-distortion embeddings of finite metric spaces. In: Handbook of Discrete and Computational Geometry. CRC Press, LLC (2004)
14. Krauthgamer, R., Lee, J.R.: Algorithms on negatively curved spaces. In: FOCS 2006 (2006)
15. Rabinovich, Y., Raz, R.: Lower bounds on the distortion of embedding finite metric spaces in graphs. Discr. Comput. Geom. 19 (1998)
16. Shavitt, Y., Tankel, T.: On internet embedding in hyperbolic spaces for overlay construction and distance estimation. In: INFOCOM 2004 (2004)
17. Semple, C., Steel, M.: Phylogenetics. Oxford University Press, Oxford (2003)