Lund, Carsten; Yannakakis, Mihalis On the hardness of approximating minimization problems. (English) Zbl 0814.68064 J. Assoc. Comput. Mach. 41, No. 5, 960-981 (1994). Cited in 3 ReviewsCited in 205 Documents MSC: 68Q15 Complexity classes (hierarchies, relations among complexity classes, etc.) 68W10 Parallel algorithms in computer science 68R05 Combinatorics in computer science 68R10 Graph theory (including graph drawing) in computer science Keywords:graph coloring; set covering; minimization problems PDFBibTeX XMLCite \textit{C. Lund} and \textit{M. Yannakakis}, J. Assoc. Comput. Mach. 41, No. 5, 960--981 (1994; Zbl 0814.68064) Full Text: DOI