SIGN IN
SIGN UP
Approximating TSP on metrics with bounded global growth
Full Text:
PDF
Buy this Article
Authors:
T-H. Hubert Chan
Carnegie Mellon University, Pittsburgh, PA
Anupam Gupta
Carnegie Mellon University, Pittsburgh, PA
Published in:
· Proceeding
SODA '08
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Pages 690-699
Society for Industrial and Applied Mathematics
Philadelphia, PA
, USA
©2008
table of contents
2008 Article
Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 12
· Downloads (cumulative): 173
· Citation Count: 4
Tools and Resources
Buy this Article
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
approximation
combinatorial algorithms
design
path and circuit problems
theory
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder