Tree embeddings for two-edge-connected network design

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: Anupam Gupta Carnegie Mellon University, Pittsburgh, PA
Ravishankar Krishnaswamy Carnegie Mellon University, Pittsburgh, PA
R. Ravi Carnegie Mellon University, Pittsburgh, PA
Published in:
· Proceeding
SODA '10 Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms
Pages 1521-1538
Society for Industrial and Applied Mathematics Philadelphia, PA, USA ©2010
table of contents ISBN: 978-0-898716-98-6
Tree embeddings for two-edge-connected network design 2010 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 20
· Downloads (cumulative): 92
· Citation Count: 1


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