Uniform unweighted set cover: The power of non-oblivious local search

Authors:
Asaf Levin;Uri Yovel
Affiliations:
-;-
Venue:
Theoretical Computer Science
Year:
2011

Citing 16
Cited 2

On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems

SIAM Journal on Discrete Mathematics
A modified greedy heuristic for the set covering problem with improved worst case bound

Information Processing Letters
Approximation algorithms for NP-hard problems

Approximation algorithms for NP-hard problems
Approximation of k-set cover by semi-local optimization

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A tight analysis of the greedy algorithm for set cover

Journal of Algorithms
A threshold of ln n for approximating set cover

Journal of the ACM (JACM)
On Local Search for Weighted K-Set Packing

Mathematics of Operations Research
On Syntactic versus Computational Views of Approximability

SIAM Journal on Computing
Approximating discrete collections via local improvements

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Approximating k-Set Cover and Complementary Graph Coloring

Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
A Better-Than-Greedy Approximation Algorithm for the Minimum Set Cover Problem

SIAM Journal on Computing
Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs

Theory of Computing Systems
Approximating the Unweighted ${k}$-Set Cover Problem: Greedy Meets Local Search

SIAM Journal on Discrete Mathematics
Approximation algorithms for combinatorial problems

Journal of Computer and System Sciences
Covering the edges of bipartite graphs using K2,2gaphs

WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms

Tight approximation bounds for greedy frugal coverage algorithms

FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Tight approximation bounds for combinatorial frugal coverage algorithms

Journal of Combinatorial Optimization

Quantified Score

Hi-index	5.23

Visualization

Abstract

We are given n base elements and a finite collection of subsets of them. The size of any subset varies between p to k (p