SCOPUS 정보 검색 플랫폼

Volumn 70, Issue 1, 1999, Pages 39-45

The budgeted maximum coverage problem

Author keywords

Algorithms; Maximum coverage problem; Performance guarantee

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY;

MAXIMUM COVERAGE PROBLEM;

COMPUTATIONAL COMPLEXITY;

EID: 0032614948 PISSN: 00200190 EISSN: None Source Type: Journal
DOI: 10.1016/s0020-0190(99)00031-9 Document Type: Article

Times cited : (926)

References (11)

1
- 0000151052
- Locating discretionary service facilities, II: Maximizing market size, minimizing inconvenience
- O. Berman, D. Bertsimas, R.C. Larson, Locating discretionary service facilities, II: Maximizing market size, minimizing inconvenience, Oper. Res. 43 (4) (1995) 623-632.
- (1995) Oper. Res. , vol.43 , Issue.4 , pp. 623-632
- Berman, O.¹ Bertsimas, D.² Larson, R.C.³

2
- 0026901379
- Optimal location of discretionary service facilities
- O. Berman, R.C. Larson, N. Fouska, Optimal location of discretionary service facilities, Transportation Sci. 26 (3) (1992) 201-211.
- (1992) Transportation Sci. , vol.26 , Issue.3 , pp. 201-211
- Berman, O.¹ Larson, R.C.² Fouska, N.³

3
- 48749136131
- Submodular set functions, matroids and the greedy algorithm: Tight worst-case bounds and some generalizations of the Rado-Edmonds theorem
- M. Conforti, G. Cornuejols, Submodular set functions, matroids and the greedy algorithm: Tight worst-case bounds and some generalizations of the Rado-Edmonds theorem, Discrete Appl. Math. 7 (1984) 251-274.
- (1984) Discrete Appl. Math. , vol.7 , pp. 251-274
- Conforti, M.¹ Cornuejols, G.²

4
- 0029703219
- A threshold of ln(n) for approximating set cover
- U. Feige, A threshold of ln(n) for approximating set cover, in: Proc. 28th Annual ACM Symposium on the Theory of Computing, 1996, pp. 314-318.
- (1996) Proc. 28th Annual ACM Symposium on the Theory of Computing , pp. 314-318
- Feige, U.¹

5
- 0032108328
- A threshold of ln(n) for approximating set cover
- U. Feige, A threshold of ln(n) for approximating set cover, J. ACM 45 (4) (1998) 634-652.
- (1998) J. ACM , vol.45 , Issue.4 , pp. 634-652
- Feige, U.¹

6
- 0032280078
- Greedy strikes back: Improved facility location algorithms
- S. Guha, S. Khuller, Greedy strikes back: improved facility location algorithms, in: Proc. 9th Annual ACM-SIAM Symposium on Discrete Algorithms, 1998.
- (1998) Proc. 9th Annual ACM-SIAM Symposium on Discrete Algorithms
- Guha, S.¹ Khuller, S.²

7
- 33644817923
- D.S. Hochbaum (Ed.), Chapter 3, PWS Publishing Company
- D.S. Hochbaum (Ed.), Approximation Algorithms for NP-Hard Problems, Chapter 3, PWS Publishing Company, 1997.
- (1997) Approximation Algorithms for NP-Hard Problems

8
- 0006630704
- Unpublished manuscript
- D.S. Hochbaum, A. Pathria, Analysis of the greedy approach in covering problems, Unpublished manuscript, 1994.
- (1994) Analysis of the Greedy Approach in Covering Problems
- Hochbaum, D.S.¹ Pathria, A.²

10
- 0001596125
- The maximum coverage location problem
- N. Megiddo, E. Zemel, S.L. Hakimi, The maximum coverage location problem, SIAM J. Algebraic Discrete Methods 4 (2) 253-261.
- SIAM J. Algebraic Discrete Methods , vol.4 , Issue.2 , pp. 253-261
- Megiddo, N.¹ Zemel, E.² Hakimi, S.L.³

11
- 38249002165
- A probabilistic analysis of the maximal covering location problem
- R.V. Vohra, N.G. Hall, A probabilistic analysis of the maximal covering location problem, Discrete Appl. Math. 43 (1993) 175-183.
- (1993) Discrete Appl. Math. , vol.43 , pp. 175-183
- Vohra, R.V.¹ Hall, N.G.²

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