Improved Steiner Tree Approximation in Graphs Gabriel Robinsy and Alexander Zelikovskyz y

First Page		Document Content
Date: 1999-10-25 15:38:00 Spanning tree NP-complete problems Steiner tree problem NP-hard problems Quasi-bipartite graph Minimum spanning tree Rectilinear Steiner tree Vertex cover Matching Graph theory Theoretical computer science Mathematics		Improved Steiner Tree Approximation in Graphs Gabriel Robinsy and Alexander Zelikovskyz y Add to Reading List Source URL: www.cs.virginia.edu Download Document from Source Website File Size: 253,63 KB Share Document on Facebook

	Research Article Climbing the Steiner Tree—Sources of Active Information in a Genetic Algorithm for Solving the Euclidean Steiner Tree Problem Winston Ewert,1* William Dembski,2 Robert J. Marks II1 DocID: 1tff1 - View Document
	comput. complex), 281 – 040281–27 DOIs00037c Birkh¨ DocID: 1rc9S - View Document
	A Constant-Factor Approximation for Stochastic Steiner Forest ∗ Anupam Gupta Amit Kumar DocID: 1r7hn - View Document
	LNCSFixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction DocID: 1qRse - View Document
	A Constant-Factor Approximation Algorithm for the Multicommodity Rent-or-Buy Problem Amit Kumar ∗ Anupam Gupta† DocID: 1qObK - View Document