Balanced graph partitioning

Theory of Computing Systems

Volumn 39, Issue 6, 2006, Pages 929-939

  Andreev, Konstantin ^a   Räcke, Harald ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION RATIOS; BALANCED GRAPH PARTITIONING; BICRITERIA APPROXIMATION; BISECTION PROBLEMS; GRAPH VERTEX; POLYLOGARITHMIC APPROXIMATION; POLYNOMIAL TIME APPROXIMATION ALGORITHMS; POLYNOMIAL-TIME;

APPROXIMATION ALGORITHMS; POLYNOMIAL APPROXIMATION;

GRAPH THEORY;

EID: 33845324514     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-006-1350-7     Document Type: Conference Paper

References (19)

1. [AKK] Sanjeev Arora, David R. Karger, and Marek Karpinski. Polynomial time approximation schemes for dense instances of NP-hard problems. In Proceedings of the 21th ACM Symposium on Theory of Computing (STOC), pages 284-293, 1995.
2. [ARV] Sanjeev Arora, Satish Rao, and Umesh Vazirani. Expander flows, geometric embeddings, and graph partitionings. In Proceedings of the 36th ACM Symposium on Theory of Computing (STOC), pages 222-231, 2004.
3. [ENRS1] Guy Even, Joseph (Seffi) Naor, Satish B. Rao, and Barach Schieber. Fast approximate graph partitioning algorithms. SIAM Journal on Computing, 28(6):2187-2214, 1999.
4. Also in Proc. &th SODA, 1997, pp. 639-648.
5. [ENRS2] Guy Even, Joseph (Seffi) Naor, Satish Rao, and Baruch Schieber. Divide-and-conquer approximation algorithms via spreading metrics. Journal of the ACM, 47(4):585-616, 2000.
6. Also in Proc. 36th FOCS, 1995, pp. 62-71.
7. [FK] Uriel Feige and Robert Krauthgamer. A polylogarithmic approximation of the minimum bisection. SIAM Journal on Computing, 31(4):1090-1118, 2002.
8. Also in Proc. 32nd STOC, 2000, pp. 530-536.
9. [FKN] Uriel Feige, Robert Krauthgamer, and Kobbi Nissim. Approximating the minimum bisection size. In Proceedings of the 32nd ACM Symposium on Theory of Computing (STOC), pages 530-536, 2000.
10. [FM] Charles M. Fiduccia and Robert M. Mattheyses. A linear time heuristic for improving network partitions. In Proceedings of the 19th IEEE Design Automation Conference, pages 175-181, 1982.
11. [GJ] Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide, to the Theory of NP-Completeness. Freeman, San Francisco, CA, 1979.
12. [HS] Dorit S. Hochbaum and David B. Shmoys. A polynomial approximation scheme for scheduling on uniform processors: using the dual approximation approach. SIAM Journal on Computing, 17(3):539-551, 1988.
13. [KL] Brian W. Kernigham and S. Lin. An efficient heuristic procedure for partitioning graphs. Bell Systems Technical Journal, 49(2):291-308, 1970.
14. [LMT] Frank Thomson Leighton, Fillia Makedon, and Spyros Tragoudas. Approximation algorithms for VLSI partition problems. In Proceedings of the. IEEE International Symposium on Circuits and Systems (ISCAS), pages 2865-2868, 1990.
15. [LR] Frank Thomson Leighton and Satish B. Rao. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. Journal of the ACM, 46(6):787-832, 1999.
16. [LT] Richard J. Lipton and Robert Endre Tarjan. A separator theorem for planar graphs. SIAM Journal on Applied Mathematics, 36(2):177-189, 1979.
17. [RH] Arnold L. Rosenberg and Lenwood S. Heath. Graph Separators, with Applications. Kluwer, Boston, MA, 2001.
18. [ST] Aravind Srinivasan and Chung-Piaw Teo. A constant-factor approximation algorithm for packet routing and balancing local vs. global criteria. In Proceedings of the 29th ACM Symposium on Theory of Computing (STOC), pages 636-643, 1997.
19. [SV] Huzur Saran and Vijay V. Vazirani. Finding k-cuts within twice the optimal. SIAM Journal on Computing, 24(1):101-108, 1995.