%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 myown %P 249--262 %R 10.1007/BFb0053020 %T The Hardness of Approximating Set Cover %V 1367 %& 10

@incollection{w-hasc-98, added-at = {2024-04-29T21:12:31.000+0200}, author = {Wolff, Alexander}, biburl = {https://www.bibsonomy.org/bibtex/25a35675d320b60fa82322d24ddd9ee65/awolff}, booktitle = {Lectures on Proof Verification and Approximation Algorithms}, chapter = 10, doi = {10.1007/BFb0053020}, editor = {Mayr, Ernst W. and Prömel, {Hans Jürgen} and Steger, Angelika}, interhash = {95542453aa2dcb604a287e1fb4dbeac6}, intrahash = {5a35675d320b60fa82322d24ddd9ee65}, keywords = {myown}, 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 = {2024-04-29T21:12:31.000+0200}, title = {The Hardness of Approximating Set Cover}, volume = 1367, year = 1998 }