The Hardness Of Approximation: Gap Location (1994)
| Venue: | Computational Complexity |
| Citations: | 71 - 0 self |
BibTeX
@ARTICLE{Petrank94thehardness,
author = {Erez Petrank},
title = {The Hardness Of Approximation: Gap Location},
journal = {Computational Complexity},
year = {1994},
volume = {4},
pages = {133--157}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
. We refine the complexity analysis of approximation problems by relating it to a new parameter called gap location. Many of the results obtained so far for approximations yield satisfactory analysis with respect to this refined parameter, but some known results (e.g., max- k-colorability, max 3-dimensional matching and max not-allequal 3sat) fall short of doing so. As a second contribution, our work fills the gap in these cases by presenting new reductions. Next, we present definitions and hardness results of new approximation versions of some NP-complete optimization problems. The problems we treat are vertex cover (for which we define a different optimization problem from the one treated in Papadimitriou & Yannakakis 1991), k-edge coloring, and set splitting.
