메뉴 건너뛰기




Volumn 3884 LNCS, Issue , 2006, Pages 206-217

Pay today for a rainy day: Improved approximation algorithms for demand-robust min-cut and shortest path problems

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; OPTIMIZATION; PROBLEM SOLVING; RANDOM PROCESSES; TREES (MATHEMATICS);

EID: 33745604232     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11672142_16     Document Type: Conference Paper
Times cited : (21)

References (20)
  • 2
    • 3042762207 scopus 로고    scopus 로고
    • The price of robustness
    • D. Bertsimas and M. Sim. The price of robustness. Operation Research, 52(2):35-53, 2004.
    • (2004) Operation Research , vol.52 , Issue.2 , pp. 35-53
    • Bertsimas, D.1    Sim, M.2
  • 3
    • 0000813562 scopus 로고
    • Linear programming under uncertainty
    • G. B. Dantzig. Linear programming under uncertainty. Management Sci., 1:197-206, 1955.
    • (1955) Management Sci. , vol.1 , pp. 197-206
    • Dantzig, G.B.1
  • 4
    • 33745610565 scopus 로고    scopus 로고
    • How to pay, come what may: Approximation algorithms for demand-robust covering problems
    • K. Dhamdhere, V. Goyal, R. Ravi, and M. Singh. How to pay, come what may: Approximation algorithms for demand-robust covering problems. In FOCS, pages 367-378, 2005.
    • (2005) FOCS , pp. 367-378
    • Dhamdhere, K.1    Goyal, V.2    Ravi, R.3    Singh, M.4
  • 5
    • 24944529059 scopus 로고    scopus 로고
    • On two-stage stochastic minimum spanning trees
    • K. Dhamdhere, R. Ravi, and M. Singh. On two-stage stochastic minimum spanning trees. In IPCO, pages 321-334, 2005.
    • (2005) IPCO , pp. 321-334
    • Dhamdhere, K.1    Ravi, R.2    Singh, M.3
  • 6
    • 0024090156 scopus 로고
    • A new approach to the maximum-flow problem
    • A. V. Goldberg and R. E. Tarjan. A new approach to the maximum-flow problem. J. ACM, 35(4):921-940, 1988.
    • (1988) J. ACM , vol.35 , Issue.4 , pp. 921-940
    • Goldberg, A.V.1    Tarjan, R.E.2
  • 7
    • 4544311041 scopus 로고    scopus 로고
    • Boosted sampling: Approximation algorithms for stochastic optimization
    • A. Gupta, M. Pal, R. Ravi, and A. Sinha. Boosted sampling: approximation algorithms for stochastic optimization. In STOC, pages 417-426, 2004.
    • (2004) STOC , pp. 417-426
    • Gupta, A.1    Pal, M.2    Ravi, R.3    Sinha, A.4
  • 8
    • 17744400754 scopus 로고    scopus 로고
    • An edge in time saves nine: LP rounding approximation algorithms for stochastic network design
    • A. Gupta, R. Ravi, and A. Sinha. An edge in time saves nine: LP rounding approximation algorithms for stochastic network design. In FOCS, pages 218-227, 2004.
    • (2004) FOCS , pp. 218-227
    • Gupta, A.1    Ravi, R.2    Sinha, A.3
  • 9
    • 1842539379 scopus 로고    scopus 로고
    • On the costs and benefits of procrastination: Approximation algorithms for stochastic combinatorial optimization problems
    • N. Immorlica, D. Karger, M. Minkoff, and V. Mirrokni. On the costs and benefits of procrastination: Approximation algorithms for stochastic combinatorial optimization problems. In SODA, pages 684-693, 2004.
    • (2004) SODA , pp. 684-693
    • Immorlica, N.1    Karger, D.2    Minkoff, M.3    Mirrokni, V.4
  • 10
    • 0000430409 scopus 로고    scopus 로고
    • Approximation algorithms for steiner and directed multicuts
    • Philip N. Klein, Serge A. Plotkin, Satish Rao, and Eva Tardos. Approximation algorithms for steiner and directed multicuts. J. Algorithms, 22(2):241-269, 1997.
    • (1997) J. Algorithms , vol.22 , Issue.2 , pp. 241-269
    • Klein, P.N.1    Plotkin, S.A.2    Rao, S.3    Tardos, E.4
  • 13
    • 0002547250 scopus 로고
    • Games against nature
    • R. M. Thrall, C. H. Coombs, and R. L. Davis, editors, Wiley, New York
    • J. W. Milnor. Games against nature. In R. M. Thrall, C. H. Coombs, and R. L. Davis, editors, Decision Processes. Wiley, New York, 1954.
    • (1954) Decision Processes
    • Milnor, J.W.1
  • 15
    • 26944469967 scopus 로고    scopus 로고
    • Approximation algorithms for requirement cut on graphs
    • V. Nagarajan and R. Ravi. Approximation algorithms for requirement cut on graphs. In APPROX + RANDOM, pages 209-220, 2005.
    • (2005) APPROX + RANDOM , pp. 209-220
    • Nagarajan, V.1    Ravi, R.2
  • 17
    • 35048859723 scopus 로고    scopus 로고
    • Hedging uncertainty: Approximation algorithms for stochastic optimization problems
    • R. Ravi and A. Sinha. Hedging uncertainty: Approximation algorithms for stochastic optimization problems. In IPCO, pages 101-115, 2004.
    • (2004) IPCO , pp. 101-115
    • Ravi, R.1    Sinha, A.2
  • 18
    • 0033881821 scopus 로고    scopus 로고
    • Improved steiner tree approximation in graphs
    • G. Robins and A. Zelikovsky. Improved steiner tree approximation in graphs. In SODA, pages 770-779, 2000.
    • (2000) SODA , pp. 770-779
    • Robins, G.1    Zelikovsky, A.2
  • 20
    • 17744374831 scopus 로고    scopus 로고
    • Stochastic optimization is (almost) as easy as deterministic optimization
    • D. Shmoys and C. Swamy. Stochastic optimization is (almost) as easy as deterministic optimization. In FOCS, pages 228-237, 2004.
    • (2004) FOCS , pp. 228-237
    • Shmoys, D.1    Swamy, C.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.