메뉴 건너뛰기




Volumn 111, Issue 11, 2011, Pages 545-549

Approximation algorithms for the Fault-Tolerant Facility Placement problem

Author keywords

Approximation algorithms

Indexed keywords

APPROXIMATION RATIOS; FAULT-TOLERANT; LP-ROUNDING; PLACEMENT PROBLEMS; SET OF CUSTOMERS; TOTAL COSTS; TRIANGLE INEQUALITY;

EID: 79952717490     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2011.03.005     Document Type: Article
Times cited : (22)

References (18)
  • 2
    • 77952267910 scopus 로고    scopus 로고
    • An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem
    • J. Byrka, and K. Aardal An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem SIAM J. Comput. 39 6 2010 2212 2231
    • (2010) SIAM J. Comput. , vol.39 , Issue.6 , pp. 2212-2231
    • Byrka, J.1    Aardal, K.2
  • 4
    • 24344486815 scopus 로고    scopus 로고
    • Improved combinatorial algorithms for facility location problems
    • DOI 10.1137/S0097539701398594
    • M. Charikar, and S. Guha Improved combinatorial algorithms for facility location problems SIAM J. Comput. 34 4 2005 803 824 (Pubitemid 41246994)
    • (2005) SIAM Journal on Computing , vol.34 , Issue.4 , pp. 803-824
    • Charikar, M.1    Guha, S.2
  • 5
    • 1842511654 scopus 로고    scopus 로고
    • Improved approximation algorithms for uncapacitated facility location
    • F. Chudak, and D. Shmoys Improved approximation algorithms for uncapacitated facility location SIAM J. Comput. 33 1 2003 1 25
    • (2003) SIAM J. Comput. , vol.33 , Issue.1 , pp. 1-25
    • Chudak, F.1    Shmoys, D.2
  • 6
    • 0000182223 scopus 로고    scopus 로고
    • Greedy Strikes Back: Improved Facility Location Algorithms
    • S. Guha, and S. Khuller Greedy strikes back: improved facility location algorithms J. Algorithms 31 1 1999 228 248 (Pubitemid 129609603)
    • (1999) Journal of Algorithms , vol.31 , Issue.1 , pp. 228-248
    • Guha, S.1    Khuller, S.2
  • 7
    • 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 J. Algorithms 48 2 2003 429 440
    • (2003) J. Algorithms , vol.48 , Issue.2 , pp. 429-440
    • Guha, S.1    Meyerson, A.2    Munagala, K.3
  • 8
    • 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. Vazirani An approximation algorithm for the fault-tolerant metric facility location problem Algorithmica 38 3 2003 433 439 (Pubitemid 40871683)
    • (2003) Algorithmica (New York) , vol.38 , Issue.3 , pp. 433-439
    • Jain, K.1    Vazirani, V.V.2
  • 9
    • 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. Vazirani Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation J. ACM 48 2 2001 274 296
    • (2001) J. ACM , vol.48 , Issue.2 , pp. 274-296
    • Jain, K.1    Vazirani, V.2
  • 10
    • 3142755912 scopus 로고    scopus 로고
    • Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
    • K. Jain, M. Mahdian, E. Markakis, A. Saberi, and V. Vazirani Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP J. ACM 50 6 2003 795 824
    • (2003) J. ACM , vol.50 , Issue.6 , pp. 795-824
    • Jain, K.1    Mahdian, M.2    Markakis, E.3    Saberi, A.4    Vazirani, V.5
  • 11
    • 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 J. Comput. 36 2 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
  • 12
    • 0030714232 scopus 로고    scopus 로고
    • A subconstant error-probability low-degree test, and a subconstant error-probability PCP characterization of NP
    • R. Raz, S. Safra, A subconstant error-probability low-degree test, and a subconstant error-probability PCP characterization of NP, in: Proc. 29th Annual ACM Symposium on Theory of Computing (STOC97), 1997, pp. 475-484.
    • (1997) Proc. 29th Annual ACM Symposium on Theory of Computing (STOC97) , pp. 475-484
    • Raz, R.1    Safra, S.2
  • 13
    • 20744435247 scopus 로고    scopus 로고
    • The design and analysis of approximation algorithms: Facility location as a case study
    • S. Hosten, J. Lee, R. Thomas (Eds.)
    • D.B. Shmoys, The design and analysis of approximation algorithms: facility location as a case study, in: S. Hosten, J. Lee, R. Thomas (Eds.), Trends in Optimization, in: AMS Proceedings of Symposia in Applied Mathematics, vol. 61, 2004, pp. 85-97.
    • (2004) Trends in Optimization, In: AMS Proceedings of Symposia in Applied Mathematics , vol.61 , pp. 85-97
    • Shmoys, D.B.1
  • 16
    • 50849136176 scopus 로고    scopus 로고
    • Fault-tolerant facility location
    • C. Swamy, and D. Shmoys Fault-tolerant facility location ACM Trans. Algorithms 4 4 2008 1 27
    • (2008) ACM Trans. Algorithms , vol.4 , Issue.4 , pp. 1-27
    • Swamy, C.1    Shmoys, D.2


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