Sciweavers

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

111

Voted

ESA
2004
Springer

85views Algorithms» more ESA 2004»

Hardness and Approximation Results for Packing Steiner Trees

15 years 6 months ago

Hardness and Approximation Results for Packing Steiner Trees

Download webdocs.cs.ualberta.ca

Joseph Cheriyan, Mohammad R. Salavatipour

Real-time Traffic

Algorithms | ESA 2004 |

claim paper

Related Content

» Approximate MinMax Theorems of Steiner RootedOrientations of Hypergraphs

» An Approximate MaxSteinerTreePacking MinSteinerCut Theorem

» An Approximate MaxSteinerTreePacking MinSteinerCut Theorem

» Approximate Maximum Parsimony and Ancestral Maximum Likelihood

» New approaches to covering and packing problems

» Approximating rooted Steiner networks

» Hardness and Approximation of Octilinear Steiner Trees

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

» How Well Can PrimalDual and LocalRatio Algorithms Perform

Post Info
More Details (n/a)

Added	20 Aug 2010
Updated	20 Aug 2010
Type	Conference
Year	2004
Where	ESA
Authors	Joseph Cheriyan, Mohammad R. Salavatipour

Comments (0)