Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

25

WG
2001
Springer

favoriteEmaildiscussreport

93views Theoretical Computer Science» more WG 2001»

Lower Bounds for Approximation Algorithms for the Steiner Tree Problem

14 years 4 months ago

Lower Bounds for Approximation Algorithms for the Steiner Tree Problem

Download www.alice-dsl.net

Clemens Gröpl, Stefan Hougardy, Till Nierhoff

Real-time Traffic

Theoretical Computer Science | WG 2001 |

claim paper

Post Info
More Details (n/a)

Added	30 Jul 2010
Updated	30 Jul 2010
Type	Conference
Year	2001
Where	WG
Authors	Clemens Gröpl, Stefan Hougardy, Till Nierhoff, Hans Jürgen Prömel

Comments (0)