A survey of approximately optimal solutions to some covering and packing problems
ACM Computing Surveys (CSUR)
Approximation of k-set cover by semi-local optimization
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Approximating discrete collections via local improvements
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Approximation Algorithms for Partial Covering Problems
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
A Modified Greedy Algorithm for the Set Cover Problem with Weights 1 and 2
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Approximation algorithms for partial covering problems
Journal of Algorithms
A modified greedy algorithm for dispersively weighted 3-set cover
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
Efficient approximation of min set cover by moderately exponential algorithms
Theoretical Computer Science
Covering the edges of bipartite graphs using K2,2 graphs
Theoretical Computer Science
A modified greedy algorithm for dispersively weighted 3-set cover
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
Covering the edges of bipartite graphs using K2,2gaphs
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Improved approximation algorithms for minimum AND-circuits problem via k-set cover
Information Processing Letters
Uniform unweighted set cover: The power of non-oblivious local search
Theoretical Computer Science
A better-than-greedy algorithm for k-set multicover
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Approximation algorithms and hardness results for labeled connectivity problems
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Approximating the unweighted k-set cover problem: greedy meets local search
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Packing-based approximation algorithm for the k-set cover problem
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Analysis of approximation algorithms for k-set cover using factor-revealing linear programs
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
| Hi-index | 0.89 |