Back to Results
First PageMeta Content
Metric 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) Euc
Add to Reading List

Document Date: 2007-10-10 14:10:39

Open Document

File Size: 208,83 KB

Share Result on Facebook

City

Geneva / Dallas / New York / Berlin / Prague / /

Company

MIT Press / /

Facility

Carnegie Mellon University / /

IndustryTerm

subexponential time algorithm / higher-dimensional peer-to-peer systems / algorithmic applications / constant approximation algorithm / approximation algorithm / height-i portals / proximity search / large networks / child portals / approximation algorithms / nearest-neighbor search / Linear time algorithms / /

Movie

W. iv / /

Organization

National Science Foundation / MIT / Computer Science Department / Carnegie Mellon University / Pittsburgh / /

Person

Satish B. Rao / Luca Trevisan / Philip N. Klein / Warren D. Smith / Kenneth L. Clarkson / Anupam Gupta / Christos Faloutsos / Jittat Fakcharoenphol / Nearest-Neighbor Methods / Farouk Kamoun / Lee-Ad Gottlieb / John Langford / Jon M. Kleinberg / Stavros G. Kolliopoulos / Goran Konjevod / Andrew Goldberg / Kunal Talwar / Robert Krauthgamer / Matthias Ruhl / Christos H. Papadimitriou / Stefan Arnborg / Artur Czumaj / Bernd-Uwe Pagel / Peter Grassberger / Itamar Procaccia / Andrzej Lingas / Flip Korn / Joseph S. B. Mitchell / Ittai Abraham / Dahlia Malkhi / Mihalis Yannakakis / David R. Karger / James R. Lee / Cyril Gavoille / Tom Wexler / Ibrahim Kamel / Sanjeev Arora / Alina Beygelzimer / Prabhakar Raghavan / Andrzej Proskurowski / Bruce M. Maggs / Alberto Belussi / K. Hildrum / Richard Cole / Hairong Zhao / Leonard Kleinrock / Satish Rao / Sham Kakade / Shuheng Zhou / H. Chan / Aleksandrs Slivkins / /

Position

Traveling Salesman / salesman / Euclidean traveling salesman / The Traveling Salesman / /

ProgrammingLanguage

TSP / /

ProvinceOrState

New York / Pennsylvania / /

PublishedMedium

Machine Learning / Physica D / /

Technology

randomized algorithm / Portaling Algorithm / Linear time algorithms / peer-to-peer / 4.1 An Algorithm / ESA / Machine Learning / TSP algorithms / previous algorithm / subexponential time algorithm / approximation algorithm / 1 k−1 algorithm / Sub-exponential time algorithm / approximation algorithms / time algorithms / constant approximation algorithm / SNP / TSP approximation algorithm / 4 Algorithms / /

SocialTag