Rounding to an integral program

Authors:
Refael Hassin;Danny Segev
Affiliations:
School of Mathematical Sciences, Tel-Aviv University, Israel;Department of Computer Science, Carnegie Mellon University, Israel, USA
Venue:
Operations Research Letters
Year:
2008

Citing 9
Cited 1

A threshold of ln n for approximating set cover

Journal of the ACM (JACM)
Constant ratio approximation algorithms for the rectangle stabbing problem and the rectilinear partitioning problem

Journal of Algorithms
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 the multi-radius cover problem

Information Processing Letters
Approximation algorithms for combinatorial problems

Journal of Computer and System Sciences
The set cover with pairs problem

FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
The multi-radius cover problem

WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
On dependent randomized rounding algorithms

Operations Research Letters

k-gap interval graphs

LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a framework for approximating NP-hard problems that can be formulated as integer-covering programs, possibly with additional side constraints, and the number of covering options is restricted in some sense, although this property may be well hidden.