A tight bound on approximating arbitrary metrics by tree metrics

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Jittat Fakcharoenphol University of California, Berkeley, CA
Satish Rao University of California, Berkeley, CA
Kunal Talwar University of California, Berkeley, CA
Published in:
· Proceeding
STOC '03 Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Pages 448-455
ACM New York, NY, USA ©2003
table of contents ISBN:1-58113-674-9 doi>10.1145/780542.780608
A tight bound on approximating arbitrary metrics by tree metrics Published by ACM 2003 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 16
· Downloads (12 Months): 84
· Downloads (cumulative): 1,332
· Citation Count: 115


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