Parallel probabilistic tree embeddings, k-median, and buy-at-bulk network design

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Guy E. Blelloch Carnegie Mellon University, Pittsburgh, PA, USA
Anupam Gupta Carnegie Mellon University, Pittsburgh, PA, USA
Kanat Tangwongsan Carnegie Mellon University, Pittsburgh, PA, USA
Published in:
Cover Image
 
· Proceeding
SPAA '12 Proceedinbgs of the 24th ACM symposium on Parallelism in algorithms and architectures
Pages 205-213
ACM New York, NY, USA ©2012
table of contents ISBN: 978-1-4503-1213-4 doi>10.1145/2312005.2312045
Parallel probabilistic tree embeddings, k-median, and buy-at-bulk network design Published by ACM 2012 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 51
· Downloads (cumulative): 51
· Citation Count: 0


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