Approximating the minimum bisection size (extended abstract)
- 1 May 2000
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 530-536
- https://doi.org/10.1145/335305.335370
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Multicommodity max-flow min-cut theorems and their use in designing approximation algorithmsJournal of the ACM, 1999
- Polynomial Time Approximation Schemes for Dense Instances of NP-Hard ProblemsJournal of Computer and System Sciences, 1999
- The approximability of NP-hard problemsPublished by Association for Computing Machinery (ACM) ,1998
- A new approach to the minimum cut problemJournal of the ACM, 1996
- Approximating s-t minimum cuts in Õ(n2) timePublished by Association for Computing Machinery (ACM) ,1996
- Finding k Cuts within Twice the OptimalSIAM Journal on Computing, 1995
- Finding good approximate vertex and edge partitions is NP-hardInformation Processing Letters, 1992
- A framework for solving VLSI graph layout problemsJournal of Computer and System Sciences, 1984
- Some simplified NP-complete graph problemsTheoretical Computer Science, 1976