Fast approximate graph partitioning algorithms

SIAM Journal on Computing

Volumn 28, Issue 6, 1999, Pages 2187-2214

  Even, Guy ^a   Naor, Joseph ^b   Rao, Satish ^c   Schieber, Baruch ^d  

^a TEL AVIV UNIVERSITY   (Israel)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c NEC LABORATORIES AMERICA   (United States)

^d IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; INTEGER PROGRAMMING; PROBLEM SOLVING;

GRAPH PARTITIONING; GRAPH SEPARATORS;

GRAPH THEORY;

EID: 0033340828     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539796308217     Document Type: Article

References (18)

1. J. W. BEERY AND M. K. GOLDBERG, Path optimization for graph partitioning problems, Discrete Appl. Math., 90 (1999), pp. 27-50.
2. G. EVEN, J. NAOR, B. SCHIEBER, AND M. SUDAN, Approximating minimum feedback sets and multicuts in directed graphs, Algorithmica, 20 (1998), pp. 151-174.
3. G. EVEN, J. NAOR, S. RAO, AND B. SCHIEBER, Divide-and-conquer approximation algorithms via spreading metrics, in Proceedings 36th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Piscataway, NJ, 1995, pp. 62-71.
4. M. L. FREDMAN AND R. E. TARJAN, Fibonacci heaps and their uses in improved network optimization algorithms, J. ACM, 34 (1987), pp. 596-615.
5. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman. San Francisco, 1979.
6. N. GARG, V. V. VAZIRANI, AND M. YANNAKAKIS, Approximate max-flow min-(multi)cut theorems and their applications, SIAM J. Comput., 25 (1996), pp. 235-251.
7. D. S. JOHNSON, C. R. ARAGON, L. A. MCGOECH, AND C. SCHEVON, Optimization by simulated annealing: Parti, graph partitioning, Oper. Res., 37 (1989), pp. 865-892.
8. B. W. KERNIGHAN AND S. LIN, An efficient heuristic procedure for partitioning graphs, Bell System Tech. J., 49 (1970), pp. 291-307.
9. T. KLOKS, Treewidth, Lecture Notes in Comput. Sci. 842, Springer-Verlag, Berlin, Heidelberg, 1994.
10. P. N. KLEIN, S. A. PLOTKIN, S. RAO, AND É. TARDOS, Approximation algorithms for Steiner and directed mutlicuts, J. Algorithms, 22 (1997), pp. 241-269.
11. T. LEIGHTON, F. MAKEDON, S. PLOTKIN, C. STEIN, É. TARDOS, AND S. TRAGOUDAS, Fast approximation algorithms for multicommodity flow problems, J. Comput. System Sci., 50 (1995), pp. 228-243.
12. T. LEIGHTON, F. MAKEDON, AND S. TRAGOUDAS, Approximation algorithms for VLSI partition problems, in Proceedings 1990 IEEE International Symposium on Circuits and Systems, (ISCAS '90), New Orleans, LA, Vol. 4. IEEE Computer Society Press, Piscataway, NJ, 1990, pp. 2865-2868.
13. T. LEIGHTON AND S. RAO, An approximate max-flow rain-cut theorem for uniform multi-commodity flow problems with applications to approximation algorithms, in Proceedings 29th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Piscataway, NJ, 1988, pp. 422-431; J. ACM, to appear.
14. K. LANG AND S. RAO, Finding near-optimal cuts: An empirical evaluation, in Proceedings 4th Annual ACM-SIAM Symposium on Discrete Algorithms, Austin, TX, 1993, SIAM, Philadelphia, 1993, pp. 212-221.
15. Y. NESTEROV AND A. NEMIROVSKII, Interior-Point Polynomial Algorithms in Convex Programming, SIAM Stud. Appl. Math. 13, SIAM, Philadelphia, 1994.
16. S. PLOTKIN, D. SHMOYS, AND É. TARDOS. Fast approximation algorithms for fractional packing and covering problems, Math. Oper. Res., 20 (1995), pp. 257-301.
17. H. D. SIMON AND S.-H. TENG, How good is recursive bisection?, SIAM J. Sci. Comput., 18 (1997), pp. 1436-1445.
18. N. YOUNG, Randomized rounding without solving the linear program, in Proceedings 6th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, 1995. SIAM, Philadelphia, 1995, pp. 170-178.