On approximating planar metrics by tree metrics

Information Processing Letters

Volumn 80, Issue 4, 2001, Pages 213-219

  Konjevod, Goran ^a   Ravi, R ^b   Salman, F Sibel ^c  

^a Arizona State University   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c PURDUE UNIVERSITY   (United States)

Author keywords

Algorithms; Combinatorial problems; Metrics; Planar graphs; Probabilistic approximations; Tree metrics

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; PROBABILITY;

PLANAR GRAPHS; TREE METRICS;

TREES (MATHEMATICS);

EID: 0035976395     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(01)00161-2     Document Type: Article

References (17)

1. On the aprroximability of numerical taxonomy
2. A graph-theoretic game and its application to the k-server problem
3. Buy-at-bulk network design
4. Probabilistic approximation of metric spaces and its algorithmic applications
5. On approximating arbitrary meics by tree metrics
6. A polylogarithmic approximation algorithm for the group Steiner tree problem
7. On isometric embeddings of graphs
8. Aligning sequences via an evolution: Complexity and approximation
9. Extensions of Lipschitz mappings into a Hilbert space
10. Excluded minors, network decomposition and multicommodity flow
11. The geometry of graphs and some of its algorithmic applications
12. Graph spanners
13. Lower bounds on the distortion of embedding finite metric spaces in graphs
14. A polynomial-time approximation scheme for minimum routing cost spanning trees
15. Probabilistic computations: Towards a unified measure of complexity