On the complexity of finding balanced oneway cuts

Information Processing Letters

Volumn 87, Issue 1, 2003, Pages 1-5

  Feige, Uriel ^a   Yahalom, Orly ^b  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Bisection; Directed graph; Graph algorithms; NP hard

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; POLYNOMIALS; PROBLEM SOLVING;

DIRECTED GRAPHS;

GRAPH THEORY;

EID: 0038586597     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(03)00251-5     Document Type: Article

References (10)

1. Bui T.N., Jones C. Finding good approximate vertex and edge partitions is NP-hard. Inform. Process. Lett. 42:(3):1992;153-159.
2. Cunningham W.H. The optimal multiterminal cut problem. DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 5:1991;105-120.
3. Feige U., Krauthgamer R. A polylogarithmic approximation of the minimum bisection. SIAM J. Comput. 31:(4):2002;1090-1118.
4. Garey M.R., Johnson D.S., Stockmeyer L. Some simplified NP-complete graph problems. Theoret. Comput. Sci. 1:(3):1976;237-267.
5. Impagliazzo R., Paturi R., Zane F. Which problems have strongly exponential complexity? Proc. 39th IEEE Symposium on Foundations of Computer Science. 1998;653-662.
6. Johnson D.S. The NP-completeness column: an ongoing guide. J. Algorithms. 8:(3):1987;438-448.
7. Karp R.M. Reducibility among combinatorial problems. Miller R.E., Thatcher J.W. Complexity of Computer Computations. 1972;85-103 Plenum Press, New York.
8. Knuth D.E. Fundamental Algorithms. 2nd edn., 1973 The Art of Computer Programming. 1:1968;Addison-Wesley, Reading, MA.
9. Leighton T., Rao S. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM. 46:(6):1999;787-832.
10. Tarjan R.E. Depth first search and linear graph algorithms. SIAM J. Comput. 1:(2):1972;146-160.