SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Theoretical Computer Science

Volumn 242, Issue 1-2, 2000, Pages 237-245

Fault tolerant K-center problems

(3) Khuller, Samir a Pless, Robert a Sussmann, Yoram J a

a University of Maryland ^* (United States)

Author keywords

Approximation algorithms; Facility location; Fault tolerance; K center

Indexed keywords

EID: 0041953557 PISSN: 03043975 EISSN: None Source Type: Journal
DOI: 10.1016/S0304-3975(98)00222-9 Document Type: Article

Times cited : (103)

References (15)

1
- 0000270477
- How to allocate network centers
- J. Bar-Ilan, G. Kortsarz, D. Peleg, How to allocate network centers, J. Algorithms 15 (1993) 385-415.
- (1993) J. Algorithms , vol.15 , pp. 385-415
- Bar-Ilan, J.¹ Kortsarz, G.² Peleg, D.³

2
- 0041494542
- The p-neighbor k-center problem
- S. Chaudhuri, N. Garg, R. Ravi, The p-neighbor k-center problem, Inform. Process. Lett. 65 (1998) 131-134.
- (1998) Inform. Process. Lett. , vol.65 , pp. 131-134
- Chaudhuri, S.¹ Garg, N.² Ravi, R.³

3
- 0022012617
- A simple heuristic for the p-center problem
- M. Dyer, A.M. Frieze, A simple heuristic for the p-center problem, Oper. Res. Lett. 3 (1985) 285-288.
- (1985) Oper. Res. Lett. , vol.3 , pp. 285-288
- Dyer, M.¹ Frieze, A.M.²

4
- 0000004961
- Bottleneck extrema
- J. Edmonds, D.R. Fulkerson, Bottleneck extrema, J. Combin. Theory, 8 (1970) 299-306.
- (1970) J. Combin. Theory , vol.8 , pp. 299-306
- Edmonds, J.¹ Fulkerson, D.R.²

5
- 0003603813
- Freeman, San Francisco
- M.R. Garey, D.S. Johnson, Computers and Intractibility: A Guide to the Theory of NP-completeness, Freeman, San Francisco, 1978.
- (1978) Computers and Intractibility: A Guide to the Theory of NP-completeness
- Garey, M.R.¹ Johnson, D.S.²

6
- 0021938963
- Clustering to minimize the maximum inter-cluster distance
- T. Gonzalez, Clustering to minimize the maximum inter-cluster distance, Theoret. Comput. Sci. 38 (1985) 293-306.
- (1985) Theoret. Comput. Sci. , vol.38 , pp. 293-306
- Gonzalez, T.¹

7
- 0022064511
- A best possible heuristic for the k-center problem
- D. Hochbaum, D.B. Shmoys, A best possible heuristic for the k-center problem, Math. Oper. Res. 10 (1985) 180-184.
- (1985) Math. Oper. Res. , vol.10 , pp. 180-184
- Hochbaum, D.¹ Shmoys, D.B.²

8
- 0022753024
- A unified approach to approximation algorithms for bottleneck problems
- D. Hochbaum, D.B. Shmoys, A unified approach to approximation algorithms for bottleneck problems, J. ACM 33(3) (1986) 533-550.
- (1986) J. ACM , vol.33 , Issue.3 , pp. 533-550
- Hochbaum, D.¹ Shmoys, D.B.²

9
- 0018542104
- Easy and hard bottleneck location problems
- W.L. Hsu, G.L. Nemhauser, Easy and hard bottleneck location problems, Discrete Appl. Math. 1 (1979) 209-216.
- (1979) Discrete Appl. Math. , vol.1 , pp. 209-216
- Hsu, W.L.¹ Nemhauser, G.L.²

10
- 0347474853
- Technical Report CS-TR-3652, University of Maryland, College Park
- S. Khuller, R. Pless, Y.J. Sussmann, fault tolerant k-center problems, Technical Report CS-TR-3652, University of Maryland, College Park, 1996, Available by ftp at ftp.cs. umd.edu/pub/papers/papers/ 3652/3652.ps.Z.
- (1996) Fault Tolerant K-center Problems
- Khuller, S.¹ Pless, R.² Sussmann, Y.J.³

11
- 84958039556
- The capacitated k-center problem
- Proc. 4th Annual European Symp. on Algorithms, Springer, Berlin
- S. Khuller, Y.J. Sussmann, The capacitated k-center problem, Proc. 4th Annual European Symp. on Algorithms, Lecture Notes in Computer Science, vol. 1136, Springer, Berlin, p. 1996, 152-166.
- (1996) Lecture Notes in Computer Science , vol.1136 , pp. 152-166
- Khuller, S.¹ Sussmann, Y.J.²

12
- 0042653424
- On a generalization of the p-center problem
- S.O. Krumke, On a generalization of the p-center problem, Inform. Process. Lett. 56 (1995) 67-71.
- (1995) Inform. Process. Lett. , vol.56 , pp. 67-71
- Krumke, S.O.¹

13
- 0009000195
- A heuristic for the p-center problem in graphs
- J. Plesnik, A heuristic for the p-center problem in graphs, Discrete Appl. Math. 17 (1987) 263-268.
- (1987) Discrete Appl. Math. , vol.17 , pp. 263-268
- Plesnik, J.¹

14
- 0348104751
- Volunteers' rescue response rates worsen in Pr. William
- April 17
- L. Smith, Volunteers' rescue response rates worsen in Pr. William, The Washington Post, April 17, 1996.
- (1996) The Washington Post
- Smith, L.¹

15
- 0347474852
- A heuristic algorithm for the k-center problem with cost and usage weights
- Q. Wang, K.H. Cheng, A heuristic algorithm for the k-center problem with cost and usage weights, Proc. 28th Annual Allerton Conf. on Communication, Control, and Computing, 1990, pp. 324-333.
- (1990) Proc. 28th Annual Allerton Conf. on Communication, Control, and Computing , pp. 324-333
- Wang, Q.¹ Cheng, K.H.²

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