Flow metrics

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

Volumn 2286, Issue , 2002, Pages 516-527

  Bornstein, Claudson F ^a   Vempala, Santosh ^b  

^a FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SET THEORY;

LINEAR ORDERING PROBLEMS; LINEAR ORDERINGS; LINEAR PROGRAMS; MINIMUM LINEAR ARRANGEMENT; NATURAL PROJECTIONS; NP-HARD; OBJECTIVE FUNCTIONS; PATHWIDTH;

LINEAR PROGRAMMING;

EID: 84937398376     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45995-2_45     Document Type: Conference Paper

References (10)

1. Y. Bartal, Probabilistic Approximation of Metric Spaces and its Algorithmic Applications, Proc. of the 37th Ann. IEEE Symp. on Foundations of Computer Science, 184-193, 1996.
2. A. Blum, G. Konjevod, R. Ravi and S. Vempala, “Semi-Definite Relaxation for Minimum Bandwidth and other Vertex-Ordering Problems,” Theoretical Computer Science, 235 (2000), 25-42. Preliminary version in Proc. 30th ACM Symposium on the Theory of Computing, Dallas, 1998.
3. H. L. Bodlaender, J. R. Gilbert, H. Hafsteinsson, T. Klok, “Approximating Treewidth, Pathwidth, and Minimum Elimination Tree Height,” Journal of Algorithms 18 (1995) 238-255.
4. M. M. Deza and M. Laurent, Geometry of cuts and metrics, Springer-Verlag, 1997.
5. J. Dunagan and S. Vempala, “On Euclidean embeddings and bandwidth minimization,” Proc. of the 5th Intl. Symp. on Randomization and Approximation techniques in Computer Science, 229-240, 2001.
6. G. Even. J. Naor, S. Rao and B. Schieber, “Divide-and-conquer approximation algorithms via spreading metrics,” Proceedings of the 35th Annual Conference on Foundations of Computer Science, 62-71, 1995.
7. M. Grötschel, L. Lovász, A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Springer, 1988.
8. M. Goemans and D. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, JACM, 42: 1115–1145, 1995.
9. T. Leighton and S. Rao. “An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms.” In Proc. of 28th FOCS, pp256-69, 1988.
10. S. Rao and A. Richa, “New Approximation Techniques for Some Ordering Problems,” Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 211-218, 1998.