Approximating Connected Facility Location Problems via Random Facility Sampling and Core Detouring Thomas Rothvoß Institute of Mathematics ´

First Page		Document Content
Date: 2013-11-01 17:11:36 NP-complete problems Operations research Approximation algorithms Steiner tree problem Facility location problem APX Approximation		Approximating Connected Facility Location Problems via Random Facility Sampling and Core Detouring Thomas Rothvoß Institute of Mathematics ´ Add to Reading List Source URL: www.math.washington.edu Download Document from Source Website File Size: 300,37 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