Nicole Immorlica, David Karger, Maria Minkoff, and Vahab Mirrokni. On the costs and benefits of procrastination: Approximation algorithms for stochastic combinatorial optimization problems. In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 684--693, 2004. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Boosted Sampling: Approximation Algorithms for Stochastic .. - Gupta, Pal, Ravi, Sinha (2004) (1 citation) (Correct)
No context found.
Nicole Immorlica, David Karger, Maria Minkoff, and Vahab Mirrokni. On the costs and benefits of procrastination: Approximation algorithms for stochastic combinatorial optimization problems. In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 684--693, 2004.
Boosted Sampling: Approximation Algorithms for Stochastic.. - Pal, Ravi, Sinha (2003) (1 citation) (Correct)
No context found.
Nicole Immorlica, David Karger, Maria Minkoff, and Vahab Mirrokni. On the costs and benefits of procrastination: Approximation algorithms for stochastic combinatorial optimization problems. In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, 2004. to appear.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC