![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 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](https://www.pdfsearch.io/img/448c31f4c0f74ab99ad4e545500bf91d.jpg) Date: 2008-10-28 21:25:22NP-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 ListSource URL: cccg.caDownload Document from Source Website File Size: 105,77 KBShare Document on Facebook
|