CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Approximation Algorithms for the Minimum-Length Corridor and Related Problems Arturo Gonzalez-Gutierrez∗

First Page		Document Content
Date: 2008-10-28 21:25:22 NP-complete problems Operations research Approximation algorithm Travelling salesman problem APX Steiner tree problem Algorithm Set cover problem Reduction Theoretical computer science Computational complexity theory Applied mathematics		CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Approximation Algorithms for the Minimum-Length Corridor and Related Problems Arturo Gonzalez-Gutierrez∗ Add to Reading List Source URL: cccg.ca Download Document from Source Website File Size: 105,77 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