Sciweavers

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

29

ALGORITHMICA
2006

favoriteEmaildiscussreport

101views more ALGORITHMICA 2006»

Approximating Rooted Connectivity Augmentation Problems

13 years 11 months ago

Approximating Rooted Connectivity Augmentation Problems

Download www.openu.ac.il

Zeev Nutov

Real-time Traffic

ALGORITHMICA 2006 |

claim paper

Related Content

» Approximating NodeConnectivity Augmentation Problems

» Tight approximation algorithm for connectivity augmentation problems

» Deterministic Sampling Algorithms for Network Design

» Approximating rooted Steiner networks

» Approximate MinMax Theorems of Steiner RootedOrientations of Hypergraphs

» Approximate minmax theorems for Steiner rootedorientations of graphs and hypergraphs

» Tree Embeddings for TwoEdgeConnected Network Design

» Approximation Algorithms for Forests Augmentation Ensuring Two Disjoint Paths of Bounded L...

» Approximating FaultTolerant GroupSteiner Problems

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2006
Where	ALGORITHMICA
Authors	Zeev Nutov

Comments (0)