Approximation algorithms for embedding general metrics into trees

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 07-09-January-2007, Issue , 2007, Pages 512-521

  BǍdoiu, Mihai ^a   Indyk, Piotr ^a   Sidiropoulos, Anastasios ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FORESTRY; GRAPH THEORY; TREES (MATHEMATICS);

MINIMUM DISTANCE; NON-TRIVIAL; OPTIMAL DISTORTION; SHORTEST PATH; SUB TREES; TIGHT BOUND; TREE EMBEDDING; UNWEIGHTED GRAPHS;

APPROXIMATION ALGORITHMS;

EID: 84969194584     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (29)

1. [ABD+05] N. Alon, M. BǍdoiu, E. Demaine, M. Farach-Colton, M. T. Hajiaghayi, and A. Sidiropoulos. Ordinal embeddings of minimum relaxation: General properties, trees and ultrametrics. Proceedings of the ACMSIAM Symposium on Discrete Algorithms, 2005.
2. [ABFC+96] R. Agarwala, V. Bafna, M. Farach-Colton, B. Narayanan, M. Paterson, and M. Thorup. On the approximability of numerical taxonomy: (fitting distances by tree metrics). 7th Symposium on Discrete Algorithms, 1996.
3. [AC05] Nir Ailon and Moses Charikar. Fitting tree metrics: Hierarchical clustering and phylogeny. In Annual Symposium on Foundations of Computer Science, 2005.
4. [BCIS05] M. BǍdoiu, J. Chuzhoy, P. Indyk, and A. Sidiropoulos. Low-distortion embeddings of general metrics into the line. Annual ACM Symposium on Theory of Computing, 2005.
5. [BCIS06] Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, and Anastasios Sidiropoulos. Embedding ultrametrics into low-dimensional spaces. In Proceedings of the ACM Symposium on Computational Geometry, 2006.
6. [BDG+05] M. BǍdoiu, K. Dhamdhere, A. Gupta, Y. Rabinovich, H. Raecke, R. Ravi, and A. Sidiropoulos. Approximation algorithms for low-distortion embeddings into low-dimensional spaces. Proceedings of the ACMSIAM Symposium on Discrete Algorithms, 2005.
7. [CC95] Leizhen Cai and Derek G. Corneil. Tree spanners. SIAM J. Discrete Math, 8(3):359-387, 1995.
8. [DEKM98] R. Durbin, S. Eddy, A. Krogh, and G. Mitchison. Biological sequence analysis. Cambridge University Press, 1998.
9. [EP04] Y. Emek and D. Peleg. Approximating minimum max-stretch spanning trees on unweighted graphs. Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, 2004.
10. [Epp00] D. Eppstein. Spanning trees and spanners. Handbook of Computational Geometry (Ed. J.-R. Sack and J. Urrutia), pages 425-461, 2000.
11. [FCKW93] M. Farach-Colton, S. Kannan, and T. Warnow. A robust model for finding optimal evolutionary tree. Annual ACM Symposium on Theory of Computing, 1993.
12. [FK01] S. P. Fekete and J. Kremer. Tree spanners in planar graphs. Discrete Applied Mathematics, 108:85-103, 2001.
13. [Gup01] A. Gupta. Steiner nodes in trees don't (really) help. Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, 2001.
14. p norms. In Proceedings of Approx, 2005.
15. [HP05] Alexander Hall and Christos H. Papadimitriou. Approximating the distortion. In APPROX-RANDOM, pages 111-122, 2005.
16. [Ind01] P. Indyk. Tutorial: Algorithmic applications of lowdistortion geometric embeddings. Annual Symposium on Foundations of Computer Science, 2001.
17. [KRS04] C. Kenyon, Y. Rabani, and A. Sinclair. Low distortion maps between point sets. Annual ACM Symposium on Theory of Computing, 2004.
18. [KTT98] A. Kearsley, R. Tapia, and M. Trosset. The solution of the metric stress and sstress problems in multidimensional scaling using newtons method. Computational Statistics, 1998.
19. [Lin02] N. Linial. Finite metric spaces - combinatorics, geometry and algorithms. Proc. International Congress of Mathematicians III, pages 573-586, 2002.
20. [LLR94] N. Linial, E. London, and Y. Rabinovich. The geometry of graphs and some of its algorithmic applications. Proc. 35th Annual IEEE Symposium on Foundations of Computer Science, pages 577-591, 1994.
21. [LNP06] J. R. Lee, Assaf Naor, and Y. Peres. Trees and markov convexity. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, 2006.
22. [Mat90] J. Matoušek. Bi-lipschitz embeddings into lowdimensional euclidean spaces. Comment. Math. Univ. Carolinae, 31:589-600, 1990.
23. [MDS] MDS: Working Group on Algorithms for Multidimensional Scaling. Algorithms for multidimensional scaling. DIMACS Web Page.
24. [PR98] D. Peleg and E. Reshef. A variant of the arrow distributed directory protocol with low average case complexity. In Proc. 25th Int. Colloq. on Automata, Language and Programming, pages 670-681, 1998.
25. [PS05] C. Papadimitriou and S. Safra. The complexity of low-distortion embeddings between point sets. Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, pages 112-118, 2005.
26. [PT01] D. Peleg and D. Tendler. Low stretch spanning trees for planar graphs. Technical Report MCS01-14, The Weizmann Institute of Science, 2001.
27. [PU87] D. Peleg and J. D. Ullman. An optimal synchronizer for the hypercube. In Proc. 6th ACM Symposium on Principles of Distributed Computing, pages 77-85, 1987.
28. [Sci05] Will there ever be a tree of life that systematists can agree on? Science, 125th Anniversary Issue. Available at http://www.sciencemag.org/sciext/125th/, 2005.
29. [VRM+97] G. Venkatesan, U. Rotics, M. S. Madanlal, J. A. Makowsky, and C. P. Rangan. Restrictions of minimum spanner problems. Information and Computation, 136(2):143-164, 1997.