NEW APPROXIMATION ALGORITHMS FOR MAX 2SAT AND MAX DICUT
Authors:
- 1 January 2003
- journal article
- Published by The Operations Research Society of Japan in Journal of the Operations Research Society of Japan
- Vol. 46 (2) , 178-188
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- 0.863-Approximation Algorithm for MAX DICUT2001
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programmingJournal of the ACM, 1995
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial OptimizationSIAM Journal on Optimization, 1995
- Interior-Point Polynomial Algorithms in Convex Programming1994
- Two-prover one-round proof systems1992
- On the Shannon capacity of a graphIEEE Transactions on Information Theory, 1979