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
	COMPUTING SHORTEST PATHS USING SPARSE GAUSSIAN ELIMINATION Aydın Bulu¸c, John Gilbert, Sivan Toledo SIAM Workshop on Network Science 2014 July 6-7 · Chicago For example, U ∗ encodes the paths from lower numbered DocID: 1pimM - View Document
	Fast A3 Algorithms for Multiple Sequence Alignment Takahiro Ikeda Hiroshi Imai DocID: 1lJxM - View Document
	A Constant-Factor Approximation for Stochastic Steiner Forest ∗ Anupam Gupta Amit Kumar DocID: 14p9k - View Document
	Shortest Path Set Induced Vertex Ordering and its Application to Distributed Distance Optimal Formation Path Planning and Control on Graphs Jingjin Yu Steven M. LaValle DocID: ZxcV - View Document