Back to Results
First PageMeta Content
Graph theory / Computational complexity theory / Mathematics / NP-complete problems / Vertex cover / Steiner tree problem / Shortest path problem / Linear programming / Edge disjoint shortest pair algorithm / Minimum bottleneck spanning tree


A Constant-Factor Approximation for Stochastic Steiner Forest ∗ Anupam Gupta Amit Kumar
Add to Reading List

Document Date: 2009-03-26 07:24:20

Open Document

File Size: 372,23 KB

Share Result on Facebook