On the approximability of clique and related maximization problems☆
Under an Elsevier user license
open archive
Keywords
Inapproximability
Approximation algorithms
Clique
Independent set
Packing integer programs
Random sampling
Cited by (0)
- ☆
A preliminary version of this work appears as “The value of strong inapproximability results for clique” in the Proceedings of the ACM Symposium on Theory of Computing, 2000, pp. 144–152.
- 1
Most of this work was done while at Bell Laboratories, Lucent Technologies; part of this work was supported by NSF Award CCR-0208005.
Copyright © 2003 Published by Elsevier Inc.