%0 Conference Paper %1 conf/wg/GroplHNP01 %A Gröpl, Clemens %A Hougardy, Stefan %A Nierhoff, Till %A Prömel, Hans Jürgen %B WG %D 2001 %E Brandstädt, Andreas %E Le, Van Bang %I Springer %K dblp %P 217-228 %T Lower Bounds for Approximation Algorithms for the Steiner Tree Problem. %U http://dblp.uni-trier.de/db/conf/wg/wg2001.html#GroplHNP01 %V 2204 %@ 3-540-42707-4

@inproceedings{conf/wg/GroplHNP01, added-at = {2017-05-26T00:00:00.000+0200}, author = {Gröpl, Clemens and Hougardy, Stefan and Nierhoff, Till and Prömel, Hans Jürgen}, biburl = {https://www.bibsonomy.org/bibtex/230374bbaf4e187e90a52b1cfb58488f2/dblp}, booktitle = {WG}, crossref = {conf/wg/2001}, editor = {Brandstädt, Andreas and Le, Van Bang}, ee = {https://doi.org/10.1007/3-540-45477-2_20}, interhash = {3f220bf6e0688d1eb825eb3ddad36bd4}, intrahash = {30374bbaf4e187e90a52b1cfb58488f2}, isbn = {3-540-42707-4}, keywords = {dblp}, pages = {217-228}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T13:55:18.000+0200}, title = {Lower Bounds for Approximation Algorithms for the Steiner Tree Problem.}, url = {http://dblp.uni-trier.de/db/conf/wg/wg2001.html#GroplHNP01}, volume = 2204, year = 2001 }