ACM DL

SIGN IN   SIGN UP

 
ACM Home Page ACM Digital Library Home Page

On the costs and benefits of procrastination: approximation algorithms for stochastic combinatorial optimization problems

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: Nicole Immorlica MIT Computer Science and AI Laboratory
David Karger MIT Computer Science and AI Laboratory
Maria Minkoff MIT Computer Science and AI Laboratory
Vahab S. Mirrokni MIT Computer Science and AI Laboratory
On the costs and benefits of procrastination: approximation algorithms for stochastic combinatorial optimization problems 2004 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 31
· Citation Count: 38

Published in:
· Proceeding
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Society for Industrial and Applied Mathematics Philadelphia, PA, USA ©2004
table of contents ISBN:0-89871-558-X

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 © 2012 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