A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
Better approximation algorithms for SET SPLITTING and NOT-ALL-EQUAL SAT
Information Processing Letters
Polynomial time approximation schemes for dense instances of NP -hard problems
Journal of Computer and System Sciences
Approximation Algorithms for Maximum Coverage and Max Cut with Given Sizes of Parts
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
An approximation algorithm for max p-section
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
An Improved Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
| Hi-index | 0.00 |
An instance of Hypergraph MAX k-Cut with given sizes of parts (or HYP MAX k-CUT WITH GSP) consists of a hypergraph H = (V, E), nonnegative weights wS defined on its edges S ∈ E, and k positive integers p1, . . . , pk such that Σi=1k pi= |V|. It is required to partition the vertex set V into k parts X1, . . . ,Xk, with each part Xi having size pi, so as to maximize the total weight of edges not lying entirely in any part of the partition. The version of the problem in which |Xi| may be arbitrary is known to be approximable within a factor of 0.72 of the optimum (Andersson and Engebretsen, 1998). The authors (1999) designed an 0.5-approximation for the special case when the hypergraph is a graph. The main result of this paper is that HYP MAX k-CUT WITH GSP can be approximated within a factor of min{λ|S| : S ∈ E} of the optimum, where λr = 1 - (1 - 1/r)r - (1/r)r.