%0 Conference Paper %1 conf/dagstuhl/Wolff97 %A Wolff, Alexander %B Lectures on Proof Verification and Approximation Algorithms %D 1997 %E Mayr, Ernst W. %E Prömel, Hans Jürgen %E Steger, Angelika %I Springer %K dblp %P 249-262 %T The Hardness of Approximating Set Cover. %U http://dblp.uni-trier.de/db/conf/dagstuhl/proof1997.html#Wolff97 %V 1367 %@ 3-540-64201-3

@inproceedings{conf/dagstuhl/Wolff97, added-at = {2019-08-04T00:00:00.000+0200}, author = {Wolff, Alexander}, biburl = {https://www.bibsonomy.org/bibtex/2199c32e7e0ee51c51966a37f3849dc3e/dblp}, booktitle = {Lectures on Proof Verification and Approximation Algorithms}, crossref = {conf/dagstuhl/1997proof}, editor = {Mayr, Ernst W. and Prömel, Hans Jürgen and Steger, Angelika}, ee = {https://doi.org/10.1007/BFb0053020}, interhash = {ac0388affd03bee3804cac2ce5c031b9}, intrahash = {199c32e7e0ee51c51966a37f3849dc3e}, isbn = {3-540-64201-3}, keywords = {dblp}, pages = {249-262}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-08-06T11:42:24.000+0200}, title = {The Hardness of Approximating Set Cover.}, url = {http://dblp.uni-trier.de/db/conf/dagstuhl/proof1997.html#Wolff97}, volume = 1367, year = 1997 }