SIAM Journal on Discrete Mathematics
Improved lower bounds on k-independence
Journal of Graph Theory
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
Approximating maximum independent set in bounded degree graphs
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Non-approximability results for optimization problems on bounded degree instances
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Approximating coloring and maximum independent sets in 3-uniform hypergraphs
Journal of Algorithms
Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs
SIAM Journal on Computing
A note on greedy algorithms for the maximum weighted independent set problem
Discrete Applied Mathematics
A d/2 approximation for maximum weight independent set in d-claw free graphs
Nordic Journal of Computing
Approximating Maximum Independent Sets in Uniform Hypergraphs
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Approximations of Independent Sets in Graphs
APPROX '98 Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization
Approximating Min Sum Set Cover
Algorithmica
On the differential approximation of MIN SET COVER
Theoretical Computer Science
Tight Results on Minimum Entropy Set Cover
Algorithmica
Approximation algorithms for combinatorial problems
Journal of Computer and System Sciences
SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
SDP-based algorithms for maximum independent set problems on hypergraphs
Theoretical Computer Science
Hi-index | 0.05 |
In this paper we analyze several approaches to the Maximum Independent Set (MIS) problem in hypergraphs with degree bounded by a parameter @D. Since independent sets in hypergraphs can be strong and weak, we denote by MIS (MSIS) the problem of finding a maximum weak (strong) independent set in hypergraphs, respectively. We propose a general technique that reduces the worst case analysis of certain algorithms on hypergraphs to their analysis on ordinary graphs. This technique allows us to show that the greedy algorithm for MIS that corresponds to the classical greedy set cover algorithm has a performance ratio of (@D+1)/2. It also allows us to apply results on local search algorithms on graphs to obtain a (@D+1)/2 approximation for the weighted MIS and (@D+3)/5-@e approximation for the unweighted case. We improve the bound in the weighted case to @?(@D+1)/3@? using a simple partitioning algorithm. We also consider another natural greedy algorithm for MIS that adds vertices of minimum degree and achieves only a ratio of @D-1, significantly worse than on ordinary graphs. For MSIS, we give two variations of the basic greedy algorithm and describe a family of hypergraphs where both algorithms approach the bound of @D.