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

	A Constant-Factor Approximation for Stochastic Steiner Forest ∗ Anupam Gupta Amit Kumar DocID: 1r7hn - View Document
	CS264: Homework #10 Due by midnight on Wednesday, December 10, 2014 Instructions: (1) Students taking the course pass-fail should complete 5 of the exercises. Students taking the course for a letter grade should complete DocID: 1qeUz - View Document
	Information Theoretic Clustering using Minimum Spanning Trees Andreas C. M¨ uller?1 , Sebastian Nowozin2 , and Christoph H. Lampert3 1 DocID: 1pmaY - View Document
	Parameterized Complexity Dichotomy for Steiner Multicut∗ Karl Bringmann† Danny Hermelin‡ Matthias Mnich§ DocID: 1phk0 - View Document
	CCCG 2011, Toronto ON, August 10–12, 2011 Bottleneck Steiner Tree with Bounded Number of Steiner Vertices A. Karim Abu-Affash∗ Paz Carmi† DocID: 18zyF - View Document