Representing graph metrics with fewest edges

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

Volumn 2607, Issue , 2003, Pages 355-366

  Feder, T ^d   Meyerson, A ^a   Motwani, R ^b   O'Callaghan, L ^b   Panigrahy, R ^c  

^a Carnegie Mellon University   (United States)

^b Stanford University   (United States)

^c CISCO SYSTEMS   (United States)

^d NONE

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS;

AS GRAPH; COMPRESSION FACTOR; EDGE WEIGHTS; GRAPH METRICS; MAXIMUM CLIQUE; STEINER; UNIT WEIGHT;

GRAPH THEORY;

EID: 27744572533     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36494-3_32     Document Type: Article

References (19)

1. I. Althofer. "On optimal realizations of finite metric spaces by graphs." Discrete Comp. Geom 3, 1988.
2. S. Arya, G. Das, D. M. Mount, J. S. Salowe, and M. H. M. Smid. "Euclidean spanners: short, thin, and lanky." In Proc. STOC, 1995.
3. Y. Bartal. "Probabilistic approximation of metric spaces and its algorithmic applications." In Proc FOCS, 1996.
4. F. Boesch. "Properties of the distance matrix of a tree." Quart. Appl. Math. 26 (1968-69), 607-609.
5. M. Charikar, C. Chekuri, A. Goel, S. Guha, and S. Plotkin. "Approximating a finite metric by a small number of tree metrics." In Proc. FOCS, 1998.
6. F. Chung, M. Garrett, R. Graham, and D. Shallcross. "Distance realization problems with applications to internet tomography." Preprint, http://www.math.ucsd.edu/∼fan.
7. G. Das, G. Narasimhan, and J. Salowe. "A new way to weigh malnourished Euclidean graphs." In Proc. SODA, 1995.
8. I. Dinur and M. Safra. Personal communication.
9. A. W. M. Dress. "Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups." Advances in Mathematics 53 (1984), 321-402.
10. T. Feder and R. Motwani. "Clique compressions, graph partitions and speeding-up algorithms." JCSS 51 (1995), 261-272.
11. U. Feige and J. Kilian. "Zero-knowledge and chromatic number." In Proc. Annual Conf. on Comp. Complex. (1996).
12. G. Gallo, M. D. Grigoriadis, and R. E. Tarjan. "A fast parametric maximum flow algorithm and applications." SICOMP 18 (1989) 30-55.
13. A. Gupta. "Steiner points in tree metrics don't (really) help." In Proc. 12th SODA 2001, pp 220-227.
14. S. L. Hakimi and S. S. Yau. "Distance matrix of a graph and its realizability." Quart. Appl. Math. 22 (1964), 305-317.
15. J. Håstad. "Some optimal inapproximability results." In Proc STOC (1997) 1-10.
16. S. Khot. "Improved inapproximability results for max clique, chromatic number and approximate graph coloring." In Proc FOCS (2001).
17. J. Nieminen. "Realizing the distance matrix of a graph." Elektron. Informationsverarbeit. Kybernetik 12(1-2):1976, 29-31.
18. J. Pereira. "An algorithm and its role in the study of optimal graph realizations of distance matrices." Discrete Math. 79(3):1990, 299-312.
19. S. B. Rao and W. D. Smith. "Improved approximation schemes for geometrical graphs via spanners and banyans." In Proc. STOC (1998), 540-550.