The hardness of approximation: gap location

Author

Petrank, Erez

Author_Institution

Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel

fYear

1993

fDate

7-9 Jun 1993

Firstpage

275

Lastpage

284

Abstract

The author refines 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 also with respect to this refined parameter, but some known results (e.g. max-k-colorability, max-3-dimensional matching and max not-all-equal 3sat) fall short of doing so. A second contribution of is in filling the gap in these cases by presenting new reductions. Next, he presents definitions and hardness results of new approximation versions of some NP-complete optimization problems. The problems are: vertex cover, k-edge coloring, set splitting, and a restricted version of feedback vertex set and feedback arc set

Keywords

computational complexity; function approximation; optimisation; NP-complete optimization problems; approximation problems; complexity analysis; feedback arc set; feedback vertex set; gap location; hardness results; k-edge coloring; set splitting; vertex cover; Computer science; Feedback; Filling; Minimization methods; Polynomials;

fLanguage

English

Publisher

ieee

Conference_Titel

Theory and Computing Systems, 1993., Proceedings of the 2nd Israel Symposium on the

Conference_Location

Natanya

Print_ISBN

0-8186-3630-0

Type

conf

DOI

10.1109/ISTCS.1993.253461

Filename

253461