By Topic

The hardness of approximation: gap location

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Petrank, E. ; Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel

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