Date: 2007-10-10 14:10:39Metric geometry Dimension theory Fractals Machine learning Mathematical analysis Travelling salesman problem Tree decomposition Ε-net Nearest neighbor search Mathematics Theoretical computer science Geometry | | Approximating TSP on Metrics with Bounded Global Growth∗ T-H. Hubert Chan Abstract The Traveling Salesman Problem (TSP) is a canonical NP-complete problem which is known to be MAXSNP hard even on (high-dimensional) EucAdd to Reading ListSource URL: i.cs.hku.hkDownload Document from Source Website File Size: 208,83 KBShare Document on Facebook
|