Work

e-approximations with minimum packing constraint violation (extended abstract)

Year: 1992

Type: conference-paper

Abstract: We present efficient new randomized and deterministic methods for transforming optimal solutions for a type of relaxed integer linear program into provably good solutions for the corresponding NP-hard discrete optimization problem. Without any constraint violation, the ε-approximation problem for many problems of this type is itself NP-hard. Our methods provide polynomial-time ε-approximations while attempting to minimize the packing constraint violation.

Source: ACM Symposium on Theory of Computing (STOC)

DOI: 10.1145/129712.129787

Authors: Jyh-Han Lin, Jeffrey Scott Vitter

Institution: Brown University

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

Funders: National Science Foundation, Advanced Research Projects Agency, Office of Naval Research, Army Research Office

Award: Algorithmic Issues in High-Performance Computing