DMCA
Proof Checking and Approximation: Towards Tight Results (1996)
| Venue: | SIGACT News |
| Citations: | 13 - 0 self |
BibTeX
@ARTICLE{Bellare96proofchecking,
author = {Mihir Bellare},
title = {Proof Checking and Approximation: Towards Tight Results},
journal = {SIGACT News},
year = {1996},
volume = {27},
pages = {2--13}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Introduction The last few years have seen much progress in proving "non-approximability results" for well-known NP-hard optimization problems. As we know, the breakthrough has come by the application of results from probabilistic proof checking. It is an area that seems to continue to surprise: since the connection was discovered in 1991 (Feige et. al. [21]), not only have non-approximability results emerged for a wide range of problems, but the factors shown hard steadily increase. Today, tight results are known for central problems like Max-Clique and Min-Set-Cover. (That is, the approximation algorithms we have for these problems can be shown to be the best possible). Such results also seem to be in sight for Chrom-Num. These are remarkable things, especially in the light of our knowledge of just five years ago. And meanwhile we continue to make progress on the Max-SNP front, where both the algor
