Rounding to an integral program

Refael Hassin; Danny Segev

doi:10.1007/11427186_6

Rounding to an integral program

Research output: Contribution to journal › Conference article › peer-review

Abstract

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.

Original language	English
Pages (from-to)	44-54
Number of pages	11
Journal	Lecture Notes in Computer Science
Volume	3503
DOIs	https://doi.org/10.1007/11427186_6
State	Published - 2005
Externally published	Yes
Event	4th International Workshop on Experimental and Efficient Algorithms, WEA 2005 - Santorini Island, Greece Duration: 10 May 2005 → 13 May 2005

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/11427186_6

Cite this

@article{37787c3e82f5408da142fa01c1e6f343,

title = "Rounding to an integral program",

abstract = "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.",

author = "Refael Hassin and Danny Segev",

year = "2005",

doi = "10.1007/11427186_6",

language = "English",

volume = "3503",

pages = "44--54",

journal = "Lecture Notes in Computer Science",

issn = "0302-9743",

publisher = "Springer Science and Business Media Deutschland GmbH",

note = "4th International Workshop on Experimental and Efficient Algorithms, WEA 2005 ; Conference date: 10-05-2005 Through 13-05-2005",

}

TY - JOUR

T1 - Rounding to an integral program

AU - Hassin, Refael

AU - Segev, Danny

PY - 2005

Y1 - 2005

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=24944554434&partnerID=8YFLogxK

U2 - 10.1007/11427186_6

DO - 10.1007/11427186_6

M3 - Conference article

AN - SCOPUS:24944554434

SN - 0302-9743

VL - 3503

SP - 44

EP - 54

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

T2 - 4th International Workshop on Experimental and Efficient Algorithms, WEA 2005

Y2 - 10 May 2005 through 13 May 2005

ER -

Rounding to an integral program

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this