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
Published in:
Theory and Computing Systems, 1993., Proceedings of the 2nd Israel Symposium on the
Date of Conference:
7-9 Jun 1993
- Page(s):
-
275
-
284
- Meeting Date :
-
07 Jun 1993-09 Jun 1993
- Print ISBN:
-
0-8186-3630-0
- INSPEC Accession Number:
-
4534590
- Conference Location :
-
Natanya
- Digital Object Identifier :
-
10.1109/ISTCS.1993.253461
- Product Type:
-
Conference Publications