Approximating clique is almost NP-complete

[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science Pub Date : 1991-09-01 DOI:10.1109/SFCS.1991.185341

U. Feige, S. Goldwasser, L. Lovász, S. Safra, M. Szegedy

引用次数: 465

Abstract

The computational complexity of approximating omega (G), the size of the largest clique in a graph G, within a given factor is considered. It is shown that if certain approximation procedures exist, then EXPTIME=NEXPTIME and NP=P.<>

查看原文本刊更多论文

近似团几乎是np完全的

考虑了在给定因子范围内逼近图G中最大团的大小(G)的计算复杂度。证明了如果存在一定的近似过程，则EXPTIME=NEXPTIME且NP=P.>

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science

自引率

0.00%

发文量