An optimal local approximation algorithm for max-min linear programs

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Patrik Floréen University of Helsinki, Helsinki, Finland
Joel Kaasinen University of Helsinki, Helsinki, Finland
Petteri Kaski University of Helsinki, Helsinki, Finland
Jukka Suomela University of Helsinki, Helsinki, Finland
An optimal local approximation algorithm for max-min linear programs Published by ACM 2009 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 7
· Downloads (cumulative): 117
· Citation Count: 4

Published in:
Cover Image
 
· Proceeding
SPAA '09 Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Pages 260-269
ACM New York, NY, USA ©2009
table of contents ISBN: 978-1-60558-606-9 doi>10.1145/1583991.1584058

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