See this document in CiteSeerX!

0.935-Approximation Randomized Algorithm for MAX 2SAT and its Derandomization (2001)  (Make Corrections)  (3 citations)
Shiro Matuura, Tomomi Matsui
Lecture Notes in Computer Science



  Home/Search   Context   Related

 
View or download:
keisu.t.utokyo.ac.jp...METR0103.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  keisu.t.utokyo.ac.jp...techrep.0 (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: In this paper, we propose 0.935-approximation algorithm for MAX 2SAT. The approximation ratio is better than the previously known result by Zwick, which is equal to 0.93109. (Update)

Cited by:   More
Approximating MIN 2-SAT and MIN 3-SAT - Avidor, Zwick   (Correct)
Improved Rounding Techniques for the MAX 2-SAT and MAX.. - Lewin, Livnat, Zwick (2002)   (Correct)
Approximating MIN k-SAT - Avidor, Zwick (2002)   (Correct)

Similar documents (at the sentence level):
22.5%:   0.863-Approximation Algorithm for MAX DICUT - Matuura, Matsui (2001)   (Correct)

Active bibliography (related documents):   More   All
0.1:   A Unified Framework for Obtaining Improved Approximation.. - Halperin, Zwick (2002)   (Correct)
0.1:   An Improved Approximation Algorithm for the Metric.. - Sviridenko (2002)   (Correct)
0.0:   Error Reduction By Parallel Repetition - the State of the Art - Feige (1995)   (Correct)

Similar documents based on text:   More   All
0.6:   A 7/8-Approximation Algorithm for MAX 3SAT? - Karloff, Zwick (1997)   (Correct)
0.5:   Derandomizing Approximation Algorithms Based On Semidefinite.. - Mahajan, Ramesh (1999)   (Correct)
0.5:   Semidefinite Programming Approaches for MAX-2-SAT and.. - de Klerk, Warners   (Correct)

Related documents from co-citation:   More   All
3:   approximation algorithm for MAX DICUT - Matuura, Matsui - 2001
3:   Improved approximation algorithms for maximum cut and satisfiability problems us.. - GOEMANS, WILLIAMSON - 1995
3:   and linear programming (context) - Trevisan, Sorkin et al. - 1996

BibTeX entry:   (Update)

S. Matuura and T. Matsui. 0.935-approximation randomized algorithm for MAX 2SAT and its derandomization. Technical Report METR 2001-03, Department of Mathematical Engineering and Information Physics, the University of Tokyo, Japan, September 2001. http://citeseer.ist.psu.edu/article/matuura01approximation.html   More

@article{ matuura01approximation,
    author = "Shiro Matuura and Tomomi Matsui",
    title = "$0.863$-Approximation Algorithm for {MAX {DICUT}}",
    journal = "Lecture Notes in Computer Science",
    volume = "2129",
    pages = "138--??",
    year = "2001",
    url = "citeseer.ist.psu.edu/article/matuura01approximation.html" }
Citations (may not include all citations):
4212   Computers and Intractability, a Guide to the Theory of NP-Co.. (context) - Garey, Johnson - 1979
415   Improved approximation algorithms for maximum cut and satisf.. - Goemans, Williamson - 1995
307   Interior point polynomial methods in convex programming (context) - Nesterov, Nemirovskii - 1994
230   Interior point methods in semidefinite programming with appl.. - Alizadeh - 1995
69   Two-prover one-round proof systems: Their power and their pr.. (context) - Feige, Lovasz - 1992
36   Derandomizing semidefinite programming based approximation a.. (context) - Mahajan, Ramesh - 1995
30   Approximating the value of two prover proof systems, with ap.. - Feige, Goemans - 1995
23   the Shannon capacity of a graph (context) - Lovasz - 1979
6   An approximation algorithm for MAX DICUT with given sizes of.. - Ageev, Hassin et al. - 2000
1   Combinatorial Approximation Algorithms for the Maximum Direc.. - Halperin, Zwick - 2001
1   0.863-Approximation Algorithm for MAX DICUT (context) - Matuura, Matsui - 2001
http://www.math.tau.ac.il/zwick/my-online-papers.html

Documents on the same site (http://www.keisu.t.u-tokyo.ac.jp/Research/techrep.0.html):   More
An Interpolant Based on Line Segment Voronoi Diagrams - Hiyoshi, Sugihara (1999)   (Correct)
A Case Study on a Modular Transformation Strategy - Hu, Chin, Takeichi (1999)   (Correct)
A Network Flow Approach to Cost Allocation for Rooted Trees - Iwata, Zuiki (2003)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC