Back to Results
First PageMeta Content
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

Document Date: 2013-11-01 17:11:36


Open Document

File Size: 284,60 KB

Share Result on Facebook