A polynomial-time approximation scheme for weighted planar graph TSP

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Sanjeev Arora Princeton U.
Michelangelo Grigni Emory Dept. of Math. & Computer Sci., Atlanta, GA
David Karger MIT Laboratory for Computer Science, Cambridge, MA
Philip Klein Brown U.
Andrzej Woloszyn Emory Dept. of Math. & Computer Sci., Atlanta, GA
A polynomial-time approximation scheme for weighted planar graph TSP 1998 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 6
· Downloads (12 Months): 32
· Downloads (cumulative): 528
· Citation Count: 33

Published in:
· Proceeding
SODA '98 Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Pages 33-41
Society for Industrial and Applied Mathematics Philadelphia, PA, USA ©1998
table of contents ISBN:0-89871-410-9

Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder