Johan Hastad. Clique is hard to approximate within . Acta Mathematica, 182:105--142, 1999. Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
Priority Algorithms for Graph Optimization Problems - Borodin, Boyar, Larsen (Correct)
No context found.
Johan Hastad. Clique is hard to approximate within . Acta Mathematica, 182:105--142, 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC