The approximability of NP-hard problems (1998)
by
Sanjeev Arora
| Venue: | In Proceedings of the Annual ACM Symposium on Theory of Computing |
| Citations: | 11 - 0 self |
BibTeX
@INPROCEEDINGS{Arora98theapproximability,
author = {Sanjeev Arora},
title = {The approximability of NP-hard problems},
booktitle = {In Proceedings of the Annual ACM Symposium on Theory of Computing},
year = {1998},
pages = {337--348}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Many problems in combinatorial optimization are NP-hard (see [60]). This has forced researchers to explore techniques for dealing with NP-completeness. Some have considered algorithms that solve “typical”
