메뉴 건너뛰기
Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
Volumn , Issue , 2005, Pages 395-404
Adaptivity and approximation for stochastic packing problems
Author keywords

[No Author keywords available]
Indexed keywords

COMBINATORIAL PROBLEMS; MULTIDIMENSIONAL GENERALIZATION; PACKING INTEGER PROGRAMS (PIP); STOCHASTIC PACKING PROBLEMS;
EID: 20744453822     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (111)
References (11)
  • 1
    • 4544371857 scopus 로고    scopus 로고
    • On multidimensional packing problems
    • C. Chekuri and S. Khanna: On multidimensional packing problems, SIAM J. Computing 33:837-851, 2004.
    • (2004) SIAM J. Computing , vol.33 , pp. 837-851
    • Chekuri, C.1    Khanna, S.2
  • 2
    • 0000575605 scopus 로고    scopus 로고
    • Random debaters and the hardness of approximating stochastic functions
    • A. Condon, J. Feigenbaum, C. Lund and P. Shor: Random debaters and the hardness of approximating stochastic functions, SIAM J. Comp. 26:369-400, 1997.
    • (1997) SIAM J. Comp. , vol.26 , pp. 369-400
    • Condon, A.1    Feigenbaum, J.2    Lund, C.3    Shor, P.4
  • 3
    • 17744371900 scopus 로고    scopus 로고
    • Approximating the stochastic knapsack: The benefit of adaptivity
    • To appear
    • B. Dean, M. X. Goemans and J. Vondrák: Approximating the stochastic knapsack: the benefit of adaptivity. To appear in FOGS, 2004.
    • (2004) FOGS
    • Dean, B.1    Goemans, M.X.2    Vondrák, J.3
  • 4
    • 0021127125 scopus 로고
    • Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
    • A.M. Frieze and M.R.B. Clarke: Approximation algorithms for the m-dimensional 0-1 knapsack problem: worst-case and probabilistic analyses, European J. Oper. Res. 15:100-109, 1984.
    • (1984) European J. Oper. Res. , vol.15 , pp. 100-109
    • Frieze, A.M.1    Clarke, M.R.B.2
  • 5
    • 0002010884 scopus 로고    scopus 로고
    • Approximations of weighted independent set and hereditary subset problems
    • M. Halldórsson: Approximations of weighted independent set and hereditary subset problems. J. Graph Algorithms and Applications 4 (1):1-16, 2000.
    • (2000) J. Graph Algorithms and Applications , vol.4 , Issue.1 , pp. 1-16
    • Halldórsson, M.1
  • 6
    • 0030386107 scopus 로고    scopus 로고
    • 1-ε
    • 1-ε. In FOCS:627-636, 1996.
    • (1996) FOCS , pp. 627-636
    • Håstad, J.1
  • 7
    • 84947403595 scopus 로고
    • Probability inequalities for sums of bounded random variables
    • W. Hoeffding: Probability inequalities for sums of bounded random variables. Amer. Stat. Assoc. J. 58:13-30, 1963.
    • (1963) Amer. Stat. Assoc. J. , vol.58 , pp. 13-30
    • Hoeffding, W.1
  • 9
    • 0000435276 scopus 로고
    • Probabilistic construction of deterministic algorithms: Approximating packing integer programs
    • P. Raghavan: Probabilistic construction of deterministic algorithms: approximating packing integer programs. J. Comp. and System Sci. 37:130-143, 1988.
    • (1988) J. Comp. and System Sci. , vol.37 , pp. 130-143
    • Raghavan, P.1
  • 10
    • 51249173817 scopus 로고
    • Randomized rounding: A technique for provably good algorithms and algorithmic proofs
    • P. Raghavan and C. D. Thompson: Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica 7:365-374, 1987.
    • (1987) Combinatorica , vol.7 , pp. 365-374
    • Raghavan, P.1    Thompson, C.D.2
  • 11
    • 0000464556 scopus 로고
    • Improved approximations of packing and covering problems
    • A. Srinivasan. Improved approximations of packing and covering problems. In STOC:268-276, 1995.
    • (1995) STOC , pp. 268-276
    • Srinivasan, A.1

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