The Multi-budget Maximum Weighted Coverage Problem. Cellinese, F., D'Angelo, G., Monaco, G., & Velaj, Y. In Calamoneri, T. & Corò, F., editors, Algorithms and Complexity - 12th International Conference, CIAC 2021, Virtual Event, May 10-12, 2021, Proceedings, volume 12701, of Lecture Notes in Computer Science, pages 173–186, 2021. Springer.
The Multi-budget Maximum Weighted Coverage Problem [link]Paper  doi  bibtex   
@inproceedings{DBLP:conf/ciac/CellineseDMV21,
	author = {Francesco Cellinese and Gianlorenzo D'Angelo and Gianpiero Monaco and Yllka Velaj},
	bibsource = {dblp computer science bibliography, https://dblp.org},
	biburl = {https://dblp.org/rec/conf/ciac/CellineseDMV21.bib},
	booktitle = {Algorithms and Complexity - 12th International Conference, {CIAC} 2021, Virtual Event, May 10-12, 2021, Proceedings},
	date-added = {2021-05-07 15:04:05 +0200},
	date-modified = {2021-05-07 15:04:05 +0200},
	doi = {10.1007/978-3-030-75242-2\_12},
	editor = {Tiziana Calamoneri and Federico Cor{\`{o}}},
	pages = {173--186},
	publisher = {Springer},
	series = {Lecture Notes in Computer Science},
	timestamp = {Thu, 06 May 2021 09:51:58 +0200},
	title = {The Multi-budget Maximum Weighted Coverage Problem},
	url = {https://doi.org/10.1007/978-3-030-75242-2\_12},
	volume = {12701},
	year = {2021},
	Bdsk-Url-1 = {https://doi.org/10.1007/978-3-030-75242-2%5C_12}}

Downloads: 0