Approximation algorithms for hitting objects with straight lines
Discrete Applied Mathematics
The importance of being biased
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Instant Recognition of Half Integrality and 2-Approximations
APPROX '98 Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization
Approximation Algorithms for Feasible Cut and Multicut Problems
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
On dependent randomized rounding algorithms
Operations Research Letters
Approximating the k-multicut problem
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
On the multi-radius cover problem
Information Processing Letters
Optimization problems in multiple-interval graphs
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
On the parameterized complexity of multiple-interval graph problems
Theoretical Computer Science
Optimization problems in multiple-interval graphs
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |
We present a general framework for approximating several NP-hard problems that have two underlying properties in common. First, the problems we consider can be formulated as integer covering programs, possibly with additional side constraints. Second, the number of covering options is restricted in some sense, although this property may be well hidden. Our method is a natural extension of the threshold rounding technique.