메뉴 건너뛰기




Volumn 112, Issue 10, 2012, Pages 361-364

Improved approximation algorithms for the robust fault-tolerant facility location problem

Author keywords

Approximation algorithm; Facility location; Fault tolerance

Indexed keywords

APPROXIMATION RATIOS; AUXILIARY FACILITIES; FACILITY LOCATION; FACILITY LOCATION PROBLEM; FAULT-TOLERANT; LP-ROUNDING; SHIPPING COST;

EID: 84862810870     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2012.02.004     Document Type: Article
Times cited : (6)

References (24)
  • 1
    • 14644390231 scopus 로고    scopus 로고
    • Improved combinatorial approximation algorithms for the k-level facility location problem
    • DOI 10.1137/S0895480102417215
    • A. Ageev, Y. Ye, and J. Zhang Improved combinatorial approximation algorithms for the k-level facility location problem SIAM Journal on Discrete Mathematics 18 2004 207 217 (Pubitemid 40320338)
    • (2004) SIAM Journal on Discrete Mathematics , vol.18 , Issue.1 , pp. 207-217
    • Ageev, A.1    Yinyu, Y.E.2    Zhang, J.3
  • 2
    • 77952267910 scopus 로고    scopus 로고
    • An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem
    • J. Byrka, and K.I. Aardal An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem SIAM Journal on Computing 39 2010 2212 2231
    • (2010) SIAM Journal on Computing , vol.39 , pp. 2212-2231
    • Byrka, J.1    Aardal, K.I.2
  • 4
    • 77954417783 scopus 로고    scopus 로고
    • Fault-tolerant facility location: A randomized dependent LP-rounding algorithm
    • J. Byrka, A. Srinivasan, C. Swamy, Fault-tolerant facility location: A randomized dependent LP-rounding algorithm, in: Proceedings of IPCO, 2010, pp. 244-257.
    • (2010) Proceedings of IPCO , pp. 244-257
    • Byrka, J.1    Srinivasan, A.2    Swamy, C.3
  • 6
    • 84880289076 scopus 로고    scopus 로고
    • Robust fault tolerant uncapacitated facility location
    • S. Chechik, D. Peleg, Robust fault tolerant uncapacitated facility location, in: Proceedings of STACS, 2010, pp. 191-202.
    • (2010) Proceedings of STACS , pp. 191-202
    • Chechik, S.1    Peleg, D.2
  • 7
    • 61349192241 scopus 로고    scopus 로고
    • Approximation algorithms for soft-capacitated facility location in capacitated network design
    • X. Chen, and B. Chen Approximation algorithms for soft-capacitated facility location in capacitated network design Algorithmica 53 2009 263 297
    • (2009) Algorithmica , vol.53 , pp. 263-297
    • Chen, X.1    Chen, B.2
  • 8
    • 0000182223 scopus 로고    scopus 로고
    • Greedy Strikes Back: Improved Facility Location Algorithms
    • S. Guha, and S. Khuller Greedy strike back: Improved facility location algorithms Journal of Algorithms 31 1999 228 248 (Pubitemid 129609603)
    • (1999) Journal of Algorithms , vol.31 , Issue.1 , pp. 228-248
    • Guha, S.1    Khuller, S.2
  • 9
    • 0041928202 scopus 로고    scopus 로고
    • A constant factor approximation algorithm for the fault-tolerant facility location problem
    • S. Guha, A. Meyerson, and K. Munagala A constant factor approximation algorithm for the fault-tolerant facility location problem Journal of Algorithms 48 2003 429 440
    • (2003) Journal of Algorithms , vol.48 , pp. 429-440
    • Guha, S.1    Meyerson, A.2    Munagala, K.3
  • 10
    • 3142755912 scopus 로고    scopus 로고
    • Greedy facility location algorithm analyzed using dual fitting with factor-revealing LP
    • K. Jain, M. Mahdian, E. Markakis, A. Saberi, and V.V. Vazirani Greedy facility location algorithm analyzed using dual fitting with factor-revealing LP Journal of the ACM 50 2003 795 824
    • (2003) Journal of the ACM , vol.50 , pp. 795-824
    • Jain, K.1    Mahdian, M.2    Markakis, E.3    Saberi, A.4    Vazirani, V.V.5
  • 11
    • 0000682161 scopus 로고    scopus 로고
    • Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation
    • K. Jain, and V.V. Vazirani Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation Journal of the ACM 48 2001 274 296
    • (2001) Journal of the ACM , vol.48 , pp. 274-296
    • Jain, K.1    Vazirani, V.V.2
  • 12
    • 21044442700 scopus 로고    scopus 로고
    • An approximation algorithm for the fault tolerant metric facility location problem
    • DOI 10.1007/s00453-003-1070-1
    • K. Jain, and V.V. Vazirani An approximation algorithm for the fault tolerant metric facility location problem Algorithmica 38 2003 433 439 (Pubitemid 40871683)
    • (2003) Algorithmica (New York) , vol.38 , Issue.3 , pp. 433-439
    • Jain, K.1    Vazirani, V.V.2
  • 13
    • 79960012691 scopus 로고    scopus 로고
    • A 1.488-approximation algorithm for the uncapacitated facility location problem
    • S. Li, A 1.488-approximation algorithm for the uncapacitated facility location problem, in: Proceedings of ICALP, Part II, 2011, pp. 77-88.
    • (2011) Proceedings of ICALP , Issue.PART II , pp. 77-88
    • Li, S.1
  • 14
    • 33847165220 scopus 로고    scopus 로고
    • Approximation algorithms for metric facility location problems
    • DOI 10.1137/S0097539703435716
    • M. Mahdian, Y. Ye, and J. Zhang Approximation algorithms for metric facility location problems SIAM Journal on Computing 36 2006 411 432 (Pubitemid 46627294)
    • (2006) SIAM Journal on Computing , vol.36 , Issue.2 , pp. 411-432
    • Mahdian, M.1    Ye, Y.2    Zhang, J.3
  • 15
    • 0030645561 scopus 로고    scopus 로고
    • Approximation algorithms for facility location problems
    • D.B. Shmoys, E. Tardös, K.I. Aardal, Approximation algorithms for facility location problems, in: Proceedings of STOC, 1997, pp. 265-274.
    • (1997) Proceedings of STOC , pp. 265-274
    • Shmoys, D.B.1
  • 16
    • 77952518652 scopus 로고    scopus 로고
    • An efficient greedy heuristic for warehouse-retailer network design optimization
    • J. Shu An efficient greedy heuristic for warehouse-retailer network design optimization Transportation Science 44 2010 183 192
    • (2010) Transportation Science , vol.44 , pp. 183-192
    • Shu, J.1
  • 17
    • 78649780193 scopus 로고    scopus 로고
    • Integrated location and two-echelon inventory network design under uncertainty
    • J. Shu, Q. Ma, and S. Li Integrated location and two-echelon inventory network design under uncertainty Annals of Operations Research 181 2010 233 247
    • (2010) Annals of Operations Research , vol.181 , pp. 233-247
    • Shu, J.1    Ma, Q.2    Li, S.3
  • 18
    • 14644433042 scopus 로고    scopus 로고
    • Stochastic transportation-inventory network design problem
    • DOI 10.1287/opre.1040.0140
    • J. Shu, C.P. Teo, and Z.J. Max Shen Stochastic transportation-inventory network design problem Operations Research 53 2005 48 60 (Pubitemid 40320215)
    • (2005) Operations Research , vol.53 , Issue.1 , pp. 48-60
    • Shu, J.1    Teo, C.-P.2    Shen, Z.-J.M.3
  • 19
    • 84868642297 scopus 로고    scopus 로고
    • An improved approximation algorithm for the metric uncapacitated facility location problem
    • M. Sviridenko, An improved approximation algorithm for the metric uncapacitated facility location problem, in: Proceedings of IPCO, 2002, pp. 240-257.
    • (2002) Proceedings of IPCO , pp. 240-257
    • Sviridenko, M.1
  • 21
    • 77956343384 scopus 로고    scopus 로고
    • An approximation algorithm for the dynamic facility location problem
    • Kluwer Academic Publishers
    • Y. Ye, and J. Zhang An approximation algorithm for the dynamic facility location problem Combinatorial Optimization in Communication Networks 2005 Kluwer Academic Publishers 623 637
    • (2005) Combinatorial Optimization in Communication Networks , pp. 623-637
    • Ye, Y.1    Zhang, J.2
  • 22
    • 33646734528 scopus 로고    scopus 로고
    • Approximating the two-level facility location problem via a quasi-greedy approach
    • J. Zhang Approximating the two-level facility location problem via a quasi-greedy approach Mathematical Programming 108 2006 159 176
    • (2006) Mathematical Programming , vol.108 , pp. 159-176
    • Zhang, J.1
  • 23
    • 31144452012 scopus 로고    scopus 로고
    • A multiexchange local search algorithm for the capacitated facility location problem
    • DOI 10.1287/moor.1040.0125
    • J. Zhang, B. Chen, and Y. Ye A multiexchange local search algorithm for the capacitated facility location problem Mathematics of Operations Research 30 2005 389 403 (Pubitemid 43126838)
    • (2005) Mathematics of Operations Research , vol.30 , Issue.2 , pp. 389-403
    • Zhang, J.1    Chen, B.2    Ye, Y.3
  • 24
    • 34548204977 scopus 로고    scopus 로고
    • A new approximation algorithm for the k-facility location problem
    • DOI 10.1016/j.tcs.2007.05.024, PII S0304397507004665, Theory and Applications of Models of Computation
    • P. Zhang A new approximation algorithm for the k-facility location problem Theoretical Computer Science 384 2007 126 135 (Pubitemid 47320954)
    • (2007) Theoretical Computer Science , vol.384 , Issue.1 , pp. 126-135
    • Zhang, P.1


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