A Constant-Factor Approximation for Stochastic Steiner Forest ∗ Anupam Gupta Amit Kumar

First Page		Document Content
Date: 2009-03-26 07:24:20 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 Source URL: www.cs.cmu.edu Download Document from Source Website File Size: 372,23 KB Share Document on Facebook

	Theory and Techniques for Synthesizing a Family of Graph Algorithms Srinivas Nedunuri William R. Cook DocID: 1xVkB - View Document
	PDF Document DocID: 1xkJU - View Document
	Graph theory Po-Shen Loh June DocID: 1vmTo - View Document
	Graph theory Po-Shen Loh June DocID: 1vhpu - View Document
	Graph theory Po-Shen Loh June DocID: 1v8nl - View Document