A note on approximating Max-Bisection on regular graphs
- 1 August 2001
- journal article
- research article
- Published by Elsevier in Information Processing Letters
- Vol. 79 (4) , 181-188
- https://doi.org/10.1016/s0020-0190(00)00189-7
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Improved approximation algorithms for MAXk-CUT and MAX BISECTIONAlgorithmica, 1997
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programmingJournal of the ACM, 1995
- The number of matchings in random regular graphs and bipartite graphsJournal of Combinatorial Theory, Series B, 1986
- Probability Inequalities for Sums of Bounded Random VariablesJournal of the American Statistical Association, 1963