Journal of Hebei University(Natural Science Edition) >

2008 , Vol. 28 >Issue 1: 7 - 9,13

DOI: https://doi.org/10.3969/j.issn.1000-1565.2008.01.004

Approximate Algorithm for the Budgeted Maximum Coverage Problem

  • ZHANG Sheng ,
  • HE Shang-lu
Expand

Online published: 2008-01-25

Fold

Cite this article

ZHANG Sheng , HE Shang-lu . Approximate Algorithm for the Budgeted Maximum Coverage Problem[J]. Journal of Hebei University(Natural Science Edition), 2008 , 28(1) : 7 -9,13 . DOI: 10.3969/j.issn.1000-1565.2008.01.004

References

[1] Berman O., Larson RC., Bertsimas D.. LOCATING DISCRETIONARY SERVICE FACILITIES.2. MAXIMIZING MARKET SIZE, MINIMIZING INCONVENIENCE [J]. Operations Research: The Journal of the Operations Research Society of America 1995, 4(4).
[2] BERMAN O, FOUSKA N, LARSON R C. Optimal location of discretionary service facilities [J]. Transportation Science 1992, 26(03).
[3] DORIT S, HOCHBAUM A. Approximation Algorithms for NP-hard problems [M]. Boston:PWS Publishing Company 1996.
[4] FUJISHIGE S. Submodular functions and optimization [M]. Amsterdam:Elsevier Science 2005.
[5] MAXIM S. A note on maximizing a submodular set function subject to knapsack constraint [J]. Operations Research Letters 2004, 32(05).
[6] CHANDRA C, AMIT K. Maximum coverage problem with group budget constraints and applications [J]. Lecture Notes in Computer Science 2004, 12(02).
[7] Samir Khuller, Anna Moss, Joseph (Seffi) Naor. The budgeted maximum coverage problem [J]. Information processing letters 1999, 1(1).
Options
Outlines

/

〈 〉