A. Wolff. Lectures on Proof Verification and Approximation Algorithms, volume 1367 of Lecture Notes in Computer Science Tutorial, chapter 10, Springer-Verlag, (1998)
DOI: 10.1007/BFb0053020
Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Book Section
%1 w-hasc-98
%A Wolff, Alexander
%B Lectures on Proof Verification and Approximation Algorithms
%D 1998
%E Mayr, Ernst W.
%E Prömel, Hans Jürgen
%E Steger, Angelika
%I Springer-Verlag
%K
%P 249--262
%R 10.1007/BFb0053020
%T The Hardness of Approximating Set Cover
%V 1367
%& 10
@incollection{w-hasc-98,
added-at = {2023-12-13T04:23:59.000+0100},
author = {Wolff, Alexander},
biburl = {https://www.bibsonomy.org/bibtex/2a40cb3afbcd95a28afd65007afa9659f/admin},
booktitle = {Lectures on Proof Verification and Approximation Algorithms},
chapter = 10,
doi = {10.1007/BFb0053020},
editor = {Mayr, Ernst W. and Pr{\"o}mel, {Hans J{\"u}rgen} and Steger, Angelika},
interhash = {95542453aa2dcb604a287e1fb4dbeac6},
intrahash = {a40cb3afbcd95a28afd65007afa9659f},
keywords = {},
pages = {249--262},
ps = {http://www1.pub.informatik.uni-wuerzburg.de/pub/wolff/pub/w-hasc-98.ps.gz},
publisher = {Springer-Verlag},
series = {Lecture Notes in Computer Science Tutorial},
timestamp = {2023-12-13T04:23:59.000+0100},
title = {The Hardness of Approximating Set Cover},
volume = 1367,
year = 1998
}
