ℓ 2 2 spreading metrics for vertex ordering problems

Algorithmica (New York)

Volumn 56, Issue 4, 2010, Pages 577-604

  Charikar, Moses ^a   Hajiaghayi, Mohammad Taghi ^b   Karloff, Howard ^b   Rao, Satish ^c  

^a Princeton University   (United States)

^b AT AND T LABS RESEARCH   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Approximation algorithm; Minimum containing interval graph; Minimum linear arrangement; Minimum storage time product; Semidefinite programming; Vertex ordering problem

Indexed keywords

INTERVAL GRAPH; MINIMUM LINEAR ARRANGEMENT; SEMI-DEFINITE PROGRAMMING; STORAGE-TIME PRODUCTS; VERTEX ORDERING PROBLEM;

MATHEMATICAL PROGRAMMING; POLYNOMIAL APPROXIMATION;

APPROXIMATION ALGORITHMS;

EID: 74849105065     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-008-9191-1     Document Type: Conference Paper

References (30)

1. Agarwal, A., Charikar, M., Makarychev, K., Makarychev, Y.: O(√log n)-approximation algorithms for Min Uncut, Min 2CNF deletion and directed cut problems. In: Proc. of 37th STOC, pp. 573-581 (2005)
2. F. Alizadeh 1995 Interior-point methods in semidefinite programming with applications to combinatorial optimization SIAM J. Optim. 5 1 13 51 0833.90087 10.1137/0805002 1315703
3. Arora, S., Lee, J.R., Naor, A.: Euclidean distortion and the sparsest cut. In: Proc. of 37th STOC, pp. 553-562 (2005)
4. Arora, S., Rao, S., Vazirani, U.: Expander flows, geometric embeddings, and graph partitioning. In: Proc. of 36th STOC, pp. 222-231 (2004); full version available at http://www.cs.princeton.edu/~arora/pubs/arvfull.pdf
5. Y. Aumann Y. Rabani 1998 An O(log∈k) approximate min-cut max-flow theorem and approximation algorithm SIAM J. Comput. 27 1 291 301 0910.05038 10.1137/S0097539794285983 1614825
6. Bǎdoiu, M., Chuzhoy, J., Indyk, P., Sidiropoulos, A.: Low-distortion embeddings of general metrics into the line. In: Proceedings of 37th STOC, pp. 225-233 (2005)
7. Bǎdoiu, M., Demaine, E., Hajiaghayi, M., Indyk, P.: Low-dimensional embedding with extra information. In: Symposium on Computational Geometry, pp. 320-329 (2004); to appear in Discrete Comput. Geom.
8. Bǎdoiu, M., Dhamdhere, K., Gupta, A., Rabinovich, Y., Räcke, H., Ravi, R., Sidiropoulos, A.: Approximation algorithms for low-distortion embeddings into low-dimensional spaces. In: Proc. of 16th SODA, pp. 119-128 (2005)
9. S. Bhatt F.T. Leighton 1984 A framework for solving VLSI graph layout problems J. Comput. Syst. Sci. 28 2 300 343 0543.68052 10.1016/0022-0000(84) 90071-0 760549 (Pubitemid 14586282)
10. J. Bourgain 1985 On Lipschitz embedding of finite metric spaces in Hilbert space Israel J. Math. 52 1-2 46 52 0657.46013 10.1007/BF02776078 815600
11. Chawla, S., Gupta, A., Räcke, H.: Embeddings of negative-type metrics and improved approximations to Sparsest Cut. In: Proc. of 16th SODA, pp. 102-111 (2005)
12. Devanur, N., Khot, S., Saket, R., Vishnoi, N.: Integrality gaps for sparsest cut and minimum linear arrangement problems. In: Proc. of 38th STOC, pp. 537-546 (2006)
13. G. Even J. Naor S. Rao B. Schieber 1999 Fast approximate graph partitioning algorithms SIAM J. Comput. 28 6 2187 2214 0936.68109 10.1137/S0097539796308217 1698950
14. G. Even S. Naor S. Rao B. Schieber 2000 Divide-and-conquer approximation algorithms via spreading metrics J. Assoc. Comput. Mach. 47 4 585 616 1866171
15. G. Even J. Naor B. Schieber M. Sudan 1998 Approximating minimum feedback sets and multicuts in directed graphs Algorithmica 20 2 151 174 0897.68078 10.1007/PL00009191 1484534
16. Feige, U., Hajiaghayi, M.T., Lee, J.R.: Improved approximation algorithms for minimum-weight vertex separators. In: Proceedings of 37th STOC, pp. 563-572 (2005)
17. U. Feige J.R. Lee 2007 An improved approximation ratio for the minimum linear arrangement problem Inf. Process. Lett. 101 1 26 29 10.1016/j.ipl.2006. 07.009 2273224 (Pubitemid 44635488)
18. Hansen, M.: Approximation algorithms for geometric embeddings in the plane with applications to parallel processing problems. In: Proc. of 30th FOCS, pp. 604-609 (1989)
19. 1. In: Proc. of 46th FOCS, pp. 53-62 (2005)
20. Krauthgamer, R., Lee, J.R., Mendel, M., Naor, A.: Measured descent: A new embedding method for finite metrics. In: Proc. of 45th FOCS, pp. 434-443 (2004)
21. Lee, J.: On distance scales, embeddings, and efficient relaxations of the cut cone. In: Proc. of 16th SODA, pp. 92-101 (2005)
22. Leighton, F.T.: Complexity Issues in VLSI: Optimal Layout for the Shuffle-Exchange Graph and Other Networks. MIT Press, Cambridge (1983)
23. F.T. Leighton S. Rao 1999 Multi-commodity max-flow min-cut theorems and their use in designing approximation algorithms J. Assoc. Comput. Mach. 46 6 787 832 1065.68666 1753034
24. Leiserson, C.E.: Area-efficient graph layouts (for VLSI). In: Proc. of 21st FOCS, pp. 270-280 (1980)
25. N. Linial E. London Y. Rabinovich 1995 The geometry of graphs and some of its algorithmic applications Combinatorica 15 2 215 245 0827.05021 10.1007/BF01200757 1337355
26. R.J. Lipton R.E. Tarjan 1980 Applications of a planar separator theorem SIAM J. Comput. 9 3 615 627 0456.68077 10.1137/0209046 584516
27. G. Ramalingam C. Pandu Rangan 1988 A unified approach to domination problems on interval graphs Inf. Process. Lett. 27 271 274 0658.05040 10.1016/0020-0190(88)90091-9 942582 (Pubitemid 18611833)
28. Rao, S., Richa, A.: New approximation techniques for some ordering problems. In: Proc. of 9th SODA, pp. 211-218 (1998)
29. Ravi, R., Agrawal, A., Klein, P.: Ordering problems approximated: single-processor scheduling and interval graph completion. In: Proc. of 18th ICALP, pp. 751-762 (1991)
30. P.D. Seymour 1995 Packing directed circuits fractionally Combinatorica 15 2 281 288 0826.05031 10.1007/BF01200760 1337358