Rounding to an integral program |
| |
| Authors: | Refael Hassin Danny Segev |
| |
| Affiliation: | a School of Mathematical Sciences, Tel-Aviv University, Israel
b Department of Computer Science, Carnegie Mellon University, Israel, USA |
| |
| 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. |
| |
| Keywords: | Approximation algorithms LP-rounding Integer covering |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
