An approximation algorithm for hypergraph max k-cut with given sizes of parts

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

Volumn 1879, Issue , 2000, Pages 32-41

  Ageev, Alexander A ^a   Sviridenko, Maxim I ^b  

^a SOBOLEV INSTITUTE OF MATHEMATICS   (Russian Federation)

^b AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS; ALGORITHMS;

HYPERGRAPH; NON NEGATIVES; POSITIVE INTEGERS; VERTEX SET;

APPROXIMATION ALGORITHMS;

EID: 84927164743     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45253-2_4     Document Type: Article

References (11)

1. A. A. Ageev and M. I. Sviridenko, Approximation algorithms for Maximum Coverage and Max Cut with given sizes of parts, Lecture Notes in Computer Science (Proceedings of IPCO’99) 1610 (1999), 17-30.
2. G. Andersson, An approximation algorithm for Max p-Section, Lecture Notes in Computer Science (Proceedings of STACS’99) 1563 (1999), 237-247.
3. G. Andersson and L. Engebretsen, Better approximation algorithms for Set splitting and Not-All-Equal SAT, Inform. Process. Letters 65 (1998), 305-311.
4. S. Arora, D. Karger, and M. Karpinski, Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems, J. of Comput. and Syst. Sci. 58 (1999), 193-210.
5. G. Cornuejols, M. L. Fisher, and G. L. Nemhauser, Location of bank accounts to optimize float: an analytic study exact and approximate algorithms, Management Science 23 (1977), 789-810.
6. U. Feige, A threshold of ln n for approximating set cover, J. of ACM 45 (1998), 634-652.
7. U. Feige and M. Langberg, Approximation algorithms for maximization problems arising in graph partitioning, manuscript, 1999.
8. A. Frieze and M. Jerrum, Improved approximation algorithms for MAX k-CUT and MAX BISECTION, Algorithmica 18 (1997), 67-81.
9. M. X. Goemans and D. P. Williamson, Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming, J. of ACM 42 (1995), 1115-1145.
10. V. Kann, S. Khanna, J. Lagergren, and A. Panconesi, On the hardness of approximating Max k-Cut and its dual, Chic. J. Theor. Comput. Sci. 1997, Article no. 2 (1997).
11. Y. Ye, An 0.699-approximation algorithm for Max-Bisection, manuscript, 1999.