Approximate Algorithm for the Budgeted Maximum Coverage Problem

doi:10.3969/j.issn.1000-1565.2008.01.004

Journal of Hebei University (Natural Science Edition) ›› 2008, Vol. 28 ›› Issue (1): 7-9,13.DOI: 10.3969/j.issn.1000-1565.2008.01.004

Previous Articles Next Articles

Approximate Algorithm for the Budgeted Maximum Coverage Problem

ZHANG Sheng,HE Shang-lu

Online:2008-01-25 Published:2008-01-25

Abstract

CLC Number:

O221.7

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.

Approximate Algorithm for the Budgeted Maximum Coverage Problem

PDF (PC)

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 0

Recommended Articles

Metrics

Comments