Approximation of k-set cover by semi-local optimization
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On multi-dimensional packing problems
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,
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
An efficient fixed-parameter algorithm for 3-hitting set
Journal of Discrete Algorithms
Multicommodity facility location
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for partial covering problems
Journal of Algorithms
Approximation algorithms for some vehicle routing problems
Discrete Applied Mathematics
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)
Exact algorithms and applications for Tree-like Weighted Set Cover
Journal of Discrete Algorithms
Efficient sensor network design for continuous monitoring of moving objects
Theoretical Computer Science
Partition into cliques for cubic graphs: Planar case, complexity and approximation
Discrete Applied Mathematics
A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Approximation algorithms and hardness results for the clique packing problem
Discrete Applied Mathematics
Covering the edges of bipartite graphs using K2,2 graphs
Theoretical Computer Science
Approximation algorithms for some vehicle routing problems
Discrete Applied Mathematics
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)
Approximation hardness for small occurrence instances of NP-hard problems
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
Efficient sensor network design for continuous monitoring of moving objects
ALGOSENSORS'07 Proceedings of the 3rd international conference on Algorithmic aspects of wireless sensor networks
Covering the edges of bipartite graphs using K2,2gaphs
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Uniform unweighted set cover: The power of non-oblivious local search
Theoretical Computer Science
Approximation Algorithms for Multicommodity Facility Location Problems
SIAM Journal on Discrete Mathematics
A better-than-greedy algorithm for k-set multicover
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Linear kernels in linear time, or how to save k colors in O(n2) steps
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in 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
The maximum saving partition problem
Operations Research Letters
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
A 6/5-approximation algorithm for the maximum 3-cover problem
Journal of Combinatorial Optimization
| Hi-index | 0.00 |