(Enter summary)
Abstract: this paper. (Update)
Cited by: More
Fixed Parameter Algorithms for - Planar Dominating Set (2000)
(Correct)
Upper Bounds for Vertex Cover - Further Improved Rolf
(Correct)
Differential Approximation of NP-Hard Problems with Equal Size.. - Monnot
(Correct)
Similar documents (at the sentence level):
14.5%: A compendium of NP optimization problems - Crescenzi, Kann (1994)
(Correct)
Similar documents based on text: More All
0.4: Strong lower bounds on the approximability of some NPO PB-complete .. - Kann (1995)
(Correct)
0.4: Polynomially Bounded Minimization Problems That Are Hard To.. - Kann (1994)
(Correct)
0.4: On the Approximability of Removing the Smallest Number of.. - Amaldi, Kann (1995)
(Correct)
Related documents from co-citation: More All
45: Computers and Intractability: A Guide to the Theory of NP-Completeness (context) - Garey, Johnson - 1979
25: Computational Complexity (context) - Papadimitriou - 1994
21: Approximation Algorithms for NP-hard Problems (context) - Hochbaum - 1997
BibTeX entry: (Update)
P. Crescenzi and V. Kann, A compendium of NP optimization problems, http://www.nada.kth.se/ viggo/problemlist/compendium.html http://citeseer.ist.psu.edu/crescenzi98compendium.html More
@misc{ crescenzi-compendium,
author = "P. Crescenzi and V. Kann",
title = "A compendium of NP optimization problems",
text = "P. Crescenzi and V. Kann, A compendium of NP optimization problems, http://www.nada.kth.se/
viggo/problemlist/compendium.html",
url = "citeseer.ist.psu.edu/crescenzi98compendium.html" }
Citations not processed or no citations identified.
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://gn.bilkent.edu.tr:7001/0/inet-hotel/yad/resource.html):
Speeding Up Computations via Molecular Biology - Lipton (1994)
(Correct)
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