Sciweavers

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

62

Voted

ECCC
2007

59views more ECCC 2007»

Improved approximation algorithms for directed Steiner forest

15 years 2 months ago

Improved approximation algorithms for directed Steiner forest

Download crab.rutgers.edu

Sharon Feldman, Guy Kortsarz, Zeev Nutov

Real-time Traffic

ECCC 2007 |

claim paper

Related Content

» A GroupStrategyproof Cost Sharing Mechanism for the Steiner Forest Game

» Improved Approximation for the Directed Spanner Problem

» NodeWeighted Steiner Tree and Group Steiner Tree in Planar Graphs

» Euclidean PrizeCollecting Steiner Forest

» A constantfactor approximation for stochastic Steiner forest

» A General Approximation Technique for Constrained Forest Problems

» An Improved LPbased Approximation for Steiner Tree

» Approximating rooted Steiner networks

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

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2007
Where	ECCC
Authors	Sharon Feldman, Guy Kortsarz, Zeev Nutov

Comments (0)