Sciweavers

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

7

SODA
2008
ACM

favoriteEmaildiscussreport

73views Algorithms» more SODA 2008»

Set connectivity problems in undirected graphs and the directed Steiner network problem

13 years 6 months ago

Set connectivity problems in undirected graphs and the directed Steiner network problem

Download www.cs.cmu.edu

Chandra Chekuri, Guy Even, Anupam Gupta, Danny Seg

Real-time Traffic

Algorithms | SODA 2008 |

claim paper

Related Content

» Approximate minmax theorems for Steiner rootedorientations of graphs and hypergraphs

» Strong Formulations for 2NodeConnected Steiner Network Problems

» A GroupStrategyproof Cost Sharing Mechanism for the Steiner Forest Game

» Approximate MinMax Theorems of Steiner RootedOrientations of Hypergraphs

» A New ILP Formulation for 2RootConnected PrizeCollecting Steiner Networks

» Approximating rooted Steiner networks

» Approximating node connectivity problems via set covers

» A fast algorithm for computing steiner edge connectivity

» The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals

Post Info
More Details (n/a)

Added	30 Oct 2010
Updated	30 Oct 2010
Type	Conference
Year	2008
Where	SODA
Authors	Chandra Chekuri, Guy Even, Anupam Gupta, Danny Segev

Comments (0)