A polylogarithmic approximation of the minimum bisection

SIAM Journal on Computing

Volumn 31, Issue 4, 2002, Pages 1090-1118

  Feige, Uriel ^a   Krauthgamer, Robert ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Approximation algorithms; Divide and conquer; Dynamic programming; Graph partitioning; Graph separators

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DYNAMIC PROGRAMMING; GRAPH THEORY; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

GRAPH PARTITIONING; GRAPH SEPARATORS; MINIMUM BISECTION; POLYLOGARITHMIC APPROXIMATION;

APPROXIMATION THEORY;

EID: 0036519752     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539701387660     Document Type: Article

References (15)

1. Polynomial time approximation schemes for dense instances of NP-hard problems
2. An O(log k) approximate min-cut max-flow theorem and approximation algorithm
3. Graph bisection algorithms with good average case behavior
4. Finding good approximate vertex and edge partitions is NP-hard
5. Fast approximate graph partitioning algorithms
6. Approximating the minimum bisection size
7. Some simplified NP-complete graph problems
8. Finding separator cuts in planar graphs within twice the optimal
9. Excluded minors, network decomposition, and multi-commodity flow
10. An approximate max-flow min-cut theorem for uniform multi-commodity flow problems with applications to approximation algorithms
11. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
12. The geometry of graphs and some of its algorithmic applications
13. Finding k cuts within twice the optimal
14. Cut problems and their applications to divide-and-conquer
15. How good is recursive bisection?