The NP-completeness column: The many limits on approximation. | D2R Server publishing the DBLP Bibliography Database, hosted at L3S Research Center

Property	Value
dcterms:bibliographicCitation	<http://dblp.uni-trier.de/rec/bibtex/journals/talg/Johnson06>
dc:creator	<https://dblp.l3s.de/d2r/resource/authors/David_S._Johnson>
foaf:homepage	<http://dx.doi.org/doi.org%2F10.1145%2F1159892.1159901>
foaf:homepage	<https://doi.org/10.1145/1159892.1159901>
dc:identifier	DBLP journals/talg/Johnson06 (xsd:string)
dc:identifier	DOI doi.org%2F10.1145%2F1159892.1159901 (xsd:string)
dcterms:issued	2006 (xsd:gYear)
swrc:journal	<https://dblp.l3s.de/d2r/resource/journals/talg>
rdfs:label	The NP-completeness column: The many limits on approximation. (xsd:string)
foaf:maker	<https://dblp.l3s.de/d2r/resource/authors/David_S._Johnson>
swrc:number	3 (xsd:string)
swrc:pages	473-489 (xsd:string)
owl:sameAs	<http://bibsonomy.org/uri/bibtexkey/journals/talg/Johnson06/dblp>
owl:sameAs	<http://dblp.rkbexplorer.com/id/journals/talg/Johnson06>
rdfs:seeAlso	<http://dblp.uni-trier.de/db/journals/talg/talg2.html#Johnson06>
rdfs:seeAlso	<https://doi.org/10.1145/1159892.1159901>
dc:subject	Approximation algorithms, Unique Games Conjecture, clique, label cover, lower bounds, probabilistically checkable proofs, set cover (xsd:string)
dc:title	The NP-completeness column: The many limits on approximation. (xsd:string)
dc:type	<http://purl.org/dc/dcmitype/Text>
rdf:type	swrc:Article
rdf:type	foaf:Document
swrc:volume	2 (xsd:string)