Which NP-Hard Optimization Problems Admit Non-trivial Efficient Approximation Algorithms?
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Johan Håstad
Which NP-Hard Optimization Problems Admit Non-trivial Efficient Approximation Algorithms?
ICALP, 2000.

ICALP 2000
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{ICALP-2000-Hastad,
	author        = "Johan Håstad",
	booktitle     = "{Proceedings of the 27th International Colloquium on Automata, Languages and Programming}",
	doi           = "10.1007/3-540-45022-X_20",
	isbn          = "3-540-67715-1",
	pages         = "235",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Which NP-Hard Optimization Problems Admit Non-trivial Efficient Approximation Algorithms?}",
	volume        = 1853,
	year          = 2000,
}

Tags:



Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.