A well-characterized approximation problem
- 18 October 1993
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 47 (6), 301-305
- https://doi.org/10.1016/0020-0190(93)90076-l
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- The hardness of approximation: gap locationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Approximating clique is almost NP-completePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Simple Constructions of Almost k‐wise Independent Random VariablesRandom Structures & Algorithms, 1992
- Proof verification and hardness of approximation problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992