메뉴 건너뛰기




Volumn , Issue , 2003, Pages 735-736

Fault-tolerant facility location

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CACHE MEMORY; COMPUTATIONAL COMPLEXITY; COMPUTER SYSTEM RECOVERY; LINEAR PROGRAMMING; PROBABILITY; PROBLEM SOLVING; RANDOM PROCESSES; ROUTERS; SET THEORY;

EID: 0038077459     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (21)

References (15)
  • 2
    • 0032606506 scopus 로고    scopus 로고
    • Improved combinatorial algorithms for the facility location and κ-median problems
    • M. Charikar and S. Guha. Improved combinatorial algorithms for the facility location and κ-median problems. Proc. 40th IEEE FOCS, 378-388, 1999.
    • (1999) Proc. 40th IEEE FOCS , pp. 378-388
    • Charikar, M.1    Guha, S.2
  • 3
    • 23844463259 scopus 로고    scopus 로고
    • A constant-factor approximation algorithm for the κ-median problem
    • To appear
    • M. Charikar, S. Guha, É. Tardos, and D. B. Shmoys. A constant-factor approximation algorithm for the κ-median problem. JCSS, 2002, To appear.
    • (2002) JCSS
    • Charikar, M.1    Guha, S.2    Tardos, É.3    Shmoys, D.B.4
  • 4
    • 84958757894 scopus 로고    scopus 로고
    • Improved approximation algorithms for uncapacitated facility location
    • F. Chudak. Improved approximation algorithms for uncapacitated facility location. Proc. 5th IPCO, 180-194, 1998.
    • (1998) Proc. 5th IPCO , pp. 180-194
    • Chudak, F.1
  • 5
    • 1842495927 scopus 로고    scopus 로고
    • Improved approximation algorithms for the uncapacitated facility location problem
    • F. Chudak and D. Shmoys. Improved approximation algorithms for the uncapacitated facility location problem. Submitted to SIAM J. Comp.
    • SIAM J. Comp.
    • 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:228-248, 1999.
    • (1999) J. Algorithms , vol.31 , pp. 228-248
    • Guha, S.1    Khuller, S.2
  • 7
    • 0037761639 scopus 로고    scopus 로고
    • Improved algorithms for fault tolerant facility location
    • S. Guha, A. Meyerson, and K. Munagala. Improved algorithms for fault tolerant facility location. Proc. 12th ACM-SIAM SODA, 636-641, 2001.
    • (2001) Proc. 12th ACM-SIAM SODA , pp. 636-641
    • Guha, S.1    Meyerson, A.2    Munagala, K.3
  • 8
    • 0036041233 scopus 로고    scopus 로고
    • A new greedy approach for facility location problems
    • K. Jain, M. Mahdian, and A. Saberi. A new greedy approach for facility location problems. Proc. 34th ACM STOC, 731-740, 2002.
    • (2002) Proc. 34th ACM STOC , pp. 731-740
    • Jain, K.1    Mahdian, M.2    Saberi, A.3
  • 9
    • 0000682161 scopus 로고    scopus 로고
    • Approximation algorithms for metric facility location and κ-median problems using the primal-dual schema and Lagrangian relaxation
    • K. Jain and V.V. Vazirani. Approximation algorithms for metric facility location and κ-median problems using the primal-dual schema and Lagrangian relaxation. JACM 48:274-296, 2001.
    • (2001) JACM , vol.48 , pp. 274-296
    • Jain, K.1    Vazirani, V.V.2
  • 10
    • 84937402094 scopus 로고    scopus 로고
    • An approximation algorithm for the fault tolerant metric facility location problem
    • K. Jain and V.V. Vazirani. An approximation algorithm for the fault tolerant metric facility location problem. Proc. 4th APPROX, 177-183, 2000.
    • (2000) Proc. 4th APPROX , pp. 177-183
    • Jain, K.1    Vazirani, V.V.2
  • 11
    • 0026993999 scopus 로고
    • ε-Approximations with minimum packing constraint violation
    • J.-H. Lin and J. S. Vitter, ε-approximations with minimum packing constraint violation. Proc. 24th ACM STOC, 771-782, 1992.
    • (1992) Proc. 24th ACM STOC , pp. 771-782
    • Lin, J.-H.1    Vitter, J.S.2
  • 12
    • 84923069774 scopus 로고    scopus 로고
    • A greedy facility location algorithm analyzed using dual-fitting
    • M. Mahdian, E. Markakis, A. Saberi, and V. Vazirani. A greedy facility location algorithm analyzed using dual-fitting. Proc. 5th APPROX, 127-137, 2001.
    • (2001) Proc. 5th APPROX , pp. 127-137
    • Mahdian, M.1    Markakis, E.2    Saberi, A.3    Vazirani, V.4
  • 13
    • 84957042819 scopus 로고    scopus 로고
    • Improved approximation algorithms for metric facility location
    • M. Mahdian, Y. Ye, and J. Zhang. Improved approximation algorithms for metric facility location. Proc. 6th APPROX, 229-242, 2002.
    • (2002) Proc. 6th APPROX , pp. 229-242
    • Mahdian, M.1    Ye, Y.2    Zhang, J.3
  • 14
    • 0030645561 scopus 로고    scopus 로고
    • Approximation algorithms for facility location problems
    • D. B. Shmoys, É. Tardos, and K. I. Aardal. Approximation algorithms for facility location problems. Proc. 29th ACM STOC, 265-274, 1997.
    • (1997) Proc. 29th ACM STOC , pp. 265-274
    • Shmoys, D.B.1    Tardos, É.2    Aardal, K.I.3
  • 15
    • 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. Proc. 9th IPCO, 240-257, 2002.
    • (2002) Proc. 9th IPCO , pp. 240-257
    • Sviridenko, M.1


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