Sciweavers

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

50

Voted

IPL
2010

favoriteEmaildiscussreport

44views more IPL 2010»

A polylogarithmic approximation for computing non-metric terminal Steiner trees

14 years 9 months ago

A polylogarithmic approximation for computing non-metric terminal Steiner trees

Download www.cs.tau.ac.il

Iftah Gamzu, Danny Segev

Real-time Traffic

IPL 2010 |

claim paper

Related Content

» The Polymatroid Steiner Problems

» A GroupStrategyproof Cost Sharing Mechanism for the Steiner Forest Game

» Approximation Algorithms for MulticommodityType Problems with Guarantees Independent of th...

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

» New primaldual algorithms for Steiner tree problems

» Stochastic Steiner Trees Without a Root

» Data Gathering with Tunable Compression in Sensor Networks

» New Approaches for Virtual Private Network Design

Post Info
More Details (n/a)

Added	28 Jan 2011
Updated	28 Jan 2011
Type	Journal
Year	2010
Where	IPL
Authors	Iftah Gamzu, Danny Segev

Comments (0)