0.863-approximation algorithm for MAX DICUT

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2129, Issue , 2015, Pages 138-146

  Matuura, Shiro ^a   Matsui, Tomomi ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; DISTRIBUTION FUNCTIONS; OPTIMIZATION; RANDOM PROCESSES; SPHERES;

APPROXIMATION RATIOS; CAN DESIGN; SDP RELAXATION; SEPARATION TECHNIQUES; SKEWED DISTRIBUTION;

APPROXIMATION ALGORITHMS;

EID: 84923111101     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (8)

1. A. Ageev, R. Hassin and M. Sviridenko, “An approximation algorithm for MAX DICUT with given sizes of parts”, Proc. of APPROX 2000, LNCS 1913(2000), 34–41.
2. F. Alizadeh, “Interior point methods in semidefinite programming with applications to combinatorial optimization”, SIAM Journal on Optimization, 5(1995), 13–51.
3. U. Feige and L. Lovász, “Two-prover one-round proof systems: Their power and their problems”, Proc. of the 24th Annual ACM Symposium on the Theory of Computing, 1992, 733–744.
4. U. Feige and M. X. Goemans, “Approximating the value of two prover proof systems, with applications to MAX 2SAT and MAX DICUT”, Proc. of 3rd Israel Symposium on the Theory of Computing and Systems, 182–189, 1995.
5. M. X. Goemans and D. P. Williamson, “Improved approximation algorithms for maximum cut and satisfiability problems Using Semidefinite Programming”, Journal of the ACM, 42(1995), 1115-1145.
6. L. Lovász, “On the Shannon capacity of a graph”, IEEE Transactions on Information Theory, 25(1979), 1–7.
7. Y. Nesterov and A. Nemirovskii Interior point polynomial methods in convex programming, SIAM Publications, SIAM, Philadelphia, USA, 1994.
8. U. Zwick, “Analyzing the MAX 2-SAT and MAX DI-CUT approximation algorithms of Feige and Goemans”, currently available from http://www.math.tau.ac.il/˜zwick/my-online-papers.html.