Sciweavers

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

109

Voted

ISAAC
2005
Springer

100views Algorithms» more ISAAC 2005»

Hardness and Approximation of Octilinear Steiner Trees

15 years 10 months ago

Hardness and Approximation of Octilinear Steiner Trees

Download www.zaik.uni-koeln.de

Matthias Müller-Hannemann, Anna Schulze

Real-time Traffic

ISAAC 2005 |

claim paper

Related Content

» A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane

» Approximate Maximum Parsimony and Ancestral Maximum Likelihood

» Approximating rooted Steiner networks

» Hardness and Approximation Results for Packing Steiner Trees

» An Improved LPbased Approximation for Steiner Tree

» On the Covering Steiner Problem

» Hardness and Approximation of the Survivable MultiLevel Fat Tree Problem

» On the Complexity of Approximating TSP with Neighborhoods and Related Problems

» Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth

Post Info
More Details (n/a)

Added	27 Jun 2010
Updated	27 Jun 2010
Type	Conference
Year	2005
Where	ISAAC
Authors	Matthias Müller-Hannemann, Anna Schulze

Comments (0)