A PTAS for the Highway Problem Fabrizio Grandoni - NP-completeness - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2013-11-01 17:11:36 Computational complexity theory Complexity classes Theory of computation Polynomial-time approximation scheme APX Strong NP-completeness NP		A PTAS for the Highway Problem Fabrizio Grandoni & Thomas Rothvo Institute of Mathemati s EPFL, Lausanne The Highway Problem Add to Reading List Source URL: www.math.washington.edu Download Document from Source Website File Size: 284,60 KB Share Document on Facebook