comput. complex), 281 – 040281–27 DOIs00037c Birkh¨ - Random tree - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2014-11-26 08:32:22 Computational complexity theory Graph theory NP-complete problems Mathematics Travelling salesman problem Set TSP problem Steiner tree problem Vertex cover Approximation algorithm APX Cut Time complexity		comput. complex), 281 – 040281–27 DOIs00037c Birkh¨ Add to Reading List Source URL: www.cs.huji.ac.il Download Document from Source Website File Size: 1,21 MB 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