ℓ 2 2 Spreading metrics for vertex ordering problems

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2006, Pages 1018-1027

  Charikar, Moses ^a   Hajiaghayi, Mohammadtaghi ^b   Rao, Satish ^c   Karloff, Howard ^d  

^a PRINCETON UNIVERSITY   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; MINIMUM LINEAR ARRANGEMENTS; STORAGE TIME PRODUCT;

APPROXIMATION THEORY; GRAPH THEORY; METRIC SYSTEM; POLYNOMIALS;

ALGORITHMS;

EID: 33244488786     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1109557.1109670     Document Type: Conference Paper

References (17)

1. A. Agarwal, M. Charikar, K. Makarychev, and Y. Makarychev, "O(√log n)-approximation algorithms for Min Uncut, Min 2CNF deletion and directed cut problems," in Proc. 37th STOC, 573-581, 2005.
2. S. Arora, S. Rao, and U. Vazirani, "Expander flows, geometric embeddings, and graph partitioning," in Proc. 36th STOC, 222-231, 2004. Full version available at http://www.cs.princeton.edu/~arora/pubs/arvfull.pdf.
3. S. Bhatt and F. T. Leighton, "A framework for solving VLSI graph layout problems," Journal of Computer and System Sciences 28(2), 300-343, 1984.
4. G. Even, J. Naor, S. Rao, and B. Schieber, "Fast approximate graph partitioning algorithms," SIAM Journal on Computing 28(6), 2187-2214, 1999.
5. G. Even, S. Naor, S. Rao, and B. Schieber, "Divide-and-conquer approximation algorithms via spreading metrics," JACM 47(4), 585-616, 2000.
6. U. Feige and J. Lee, "Improved approximation algorithms for minimum linear arrangement," manuscript, 2005.
7. G. Even, J. Naor, B. Schieber, and M. Sudan, "Approximating minimum feedback sets and multicuts in directed graphs," Algorithmica 20(2), 151-174, 1998.
8. M. Hansen, "Approximation algorithms for geometric embeddings in the plane with applications to parallel processing problems," in Proc. 30th FOCS, 604-609, 1989.
9. J. Lee, "On distance scales, embeddings, and efficient relaxations of the cut cone," in Proc. 16th SODA, 92-101, 2005.
10. F. T. Leighton, Complexity Issues in VLSI: Optimal Layout for the Shuffle-Exchange Graph and Other Networks, MIT Press, Cambridge, MA, 1983.
11. F. T. Leighton and S. Rao, "Multi-commodity max-flow min-cut theorems and their use in designing approximation algorithms," JACM 46(6), 787-832, 1999.
12. C. E. Leiserson, "Area-efficient graph layouts (for VLSI)," in 21st FOCS, 270-280, 1980.
13. R. J. Lipton and R. E. Tarjan, "Applications of a planar separator theorem," SIAM Journal on Computing 9(3), 615-627, 1980.
14. G. Ramalingam and C. Pandu Rangan, "A unified approach to domination problems on interval graphs," Information Processing Letters 27, 271-274, 1988.
15. S. Rao and A. Richa, "New approximation techniques for some ordering problems," in Proc. 9th SODA, 211-218, 1998.
16. R. Ravi, A. Agrawal, and P. Klein, "Ordering problems approximated: single-processor scheduling and interval graph completion," Proc. 18th ICALP, 751-762, 1991.
17. P. D. Seymour, "Packing directed circuits fractionally," Combinatorica 15(2), 281-288, 1995.