Improved performance of the greedy algorithm for partial cover
Information Processing Letters
Computational Complexity of Machine Learning
Computational Complexity of Machine Learning
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
One for the Price of Two: A Unified Approach for Approximating Covering Problems
APPROX '98 Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization
The t-Vertex Cover Problem: Extending the Half Integrality Framework with Budget Constraints
APPROX '98 Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization
Approximation Algorithms for Maximum Linear Arrangement
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
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
Improved Upper Bounds for Partial Vertex Cover
Graph-Theoretic Concepts in Computer Science
Subexponential algorithms for partial cover problems
Information Processing Letters
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
On approximation of the submodular set cover problem
Operations Research Letters
| Hi-index | 0.00 |