Using homogenous weights for approximating the partial cover problem
Proceedings of the tenth 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,
Improved Approximation Algorithms for the Partial Vertex Cover Problem
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Computing small partial coverings
Information Processing Letters
Approximation algorithms for partial covering problems
Journal of Algorithms
Local ratio: A unified framework for approximation algorithms. In Memoriam: Shimon Even 1935-2004
ACM Computing Surveys (CSUR)
A general approach for incremental approximation and hierarchical clustering
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Theoretical Computer Science
A unified approach to approximating partial covering problems
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Improved Upper Bounds for Partial Vertex Cover
Graph-Theoretic Concepts in Computer Science
Approximation of partial capacitated vertex cover
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Some results on incremental vertex cover problem
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Approximation of Partial Capacitated Vertex Cover
SIAM Journal on Discrete Mathematics
A General Approach for Incremental Approximation and Hierarchical Clustering
SIAM Journal on Computing
A primal-dual approximation algorithm for partial vertex cover: making educated guesses
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Submodular integer cover and its application to production planning
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Parameterized complexity of generalized vertex cover problems
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Intuitive algorithms and t-vertex cover
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
On approximation of the submodular set cover problem
Operations Research Letters
Journal of Discrete Algorithms
| Hi-index | 0.00 |