Download:
|
by Jiawei Zhang, Yinyu Ye, Qiaoming Han
http://dollar.biz.uiowa.edu/%7Ejiazhang/newset.ps
Add To MetaCart
Abstract:
1 We present a 0:7499-approximation algorithm for Max-Set-Splitting in this paper. The previously best known result for this problem is a 0:7240-approximation by Andersson and Engebretsen [3], which is based on a semidenite programming (SDP) relaxation. Our improvement is resulted from a strengthened SDP relaxation, an improved rounding method, and a tighter analysis compared with that in [3]. Key words. Max Set Splitting, Max NAE SAT, approximation algorithm, semidefinite programming relaxation.
Citations
|
574
|
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
– Goemans, Williamson
- 1995
|
|
503
|
Optimization, approximation, and complexity classes
– Papadimitriou, Yannakakis
- 1991
|
|
383
|
Some optimal inapproximability results
– H˚astad
|
|
155
|
Polynomial time approximation schemes for dense instances of NP-hard problems
– Arora, Karger, et al.
- 1999
|
|
76
|
The hardness of approximation: Gap location
– Petrank
- 1994
|
|
52
|
Coverings and colorings of hypergraphs
– Lovász
- 1973
|
|
50
|
D.: Gadgets, approximation, and linear programming
– Trevisan, Sorkin, et al.
- 2000
|
|
49
|
Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint
– Zwick
- 1998
|
|
47
|
Outward rotations: A tool for rounding solutions of semidefinite programming relaxations, with applications to max cut and other problems
– Zwick
- 1999
|
|
31
|
A .699-approximation algorithm for Max-Bisection
– Ye
- 1999
|
|
17
|
Semide relaxation and nonconvex quadratic optimization
– Nesterov
- 1998
|
|
16
|
Semide relaxations, multivariate normal distributions, and order statistics
– Bertsimas, Ye
- 1998
|
|
13
|
An approximation algorithm for hypergraph max k-cut with given sizes of parts
– Ageev, Sviridenko
- 1999
|
|
13
|
Approximability of maximum splitting of k-sets and some other apx-complete problems
– Kann, Lagergren, et al.
- 1996
|
|
8
|
Non-oblivious Local Search for Graph and Hypergraph Coloring Problems
– Alimonti
- 1995
|
|
8
|
Better Approximation Algorithms for Set Splitting and Not-All-Equal SAT
– Andersson, Engebretsen
- 1998
|
|
6
|
An improved rounding method and semide programming relaxation for graph partition
– Han, Ye, et al.
- 2000
|
|
3
|
The Approximability of Set Splitting Problems and Satis Problems with no Mixed Clauses
– Guruswami
- 1999
|
|
2
|
A .699-Approximation Algorithm for Max-Bisection," Working Paper
– Ye
- 1999
|
|
1
|
A 7/8-approximation algorithm for MAX 3SAT?" 38th FOCS
– Karlo, Zwick
- 1997
|
