×

On the hardness of approximating minimization problems. (English) Zbl 1310.68094

Proceedings of the 25th annual ACM symposium on theory of computing, STOC ’93. San Diego, CA, USA, May 16–18, 1993. New York, NY: Association for Computing Machinery (ACM) (ISBN 0-89791-591-7). 286-293 (1993).
For the entire collection see [Zbl 1285.68003].

MSC:

68Q17 Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68R05 Combinatorics in computer science
68R10 Graph theory (including graph drawing) in computer science
PDF BibTeX XML Cite
Full Text: DOI