Die bibliographische Datenbank LEABib
![](images/empty.gif) |
![](images/empty.gif) |
Suche: Citkey="Gropl-Hougardy-Nierhoff-Promel/01" |
![](images/empty.gif) |
Lower bounds for approximation algorithms for the Steiner tree problem
Clemens Gröpl, Stefan Hougardy, Till Nierhoff, Hans Jürgen Prömel
Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2001 (Boltenhagen, Germany, June 14-16, 2001)
Lecture Notes in Computer Science
2204
, 2001, pp. 217-228
Editors | |
Andreas Brandstädt,
Van Bang Le |
Publisher: | | Springer-Verlag |
Address: | | Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Tokyo |
|
Keywords: | |
228 |
|
| |
|