EUVIMEDEUVIMED entdecken
Crossref

Approximation algorithm for prize-collecting weighted set cover with fairness constraints

Mingchao Zhou, Zhao Zhang

Discrete Applied Mathematics · 2025-10 · 373 · 301-315

DOI: 10.1016/j.dam.2025.05.010 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Discrete Applied Mathematics, 2025-10. Verfasst von Mingchao Zhou und 1 weiteren Autor:innen. Die Arbeit wurde bisher 4-mal zitiert (Crossref) und nennt 48 Literaturangaben. Gefördert von: National Natural Science Foundation of China.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Förderung

  • National Natural Science Foundation of China

Zitieren

APA

Zhou, M., & Zhang, Z. (2025). Approximation algorithm for prize-collecting weighted set cover with fairness constraints. Discrete Applied Mathematics, 373, 301-315. https://doi.org/10.1016/j.dam.2025.05.010

Vancouver

Zhou M, Zhang Z. Approximation algorithm for prize-collecting weighted set cover with fairness constraints. Discrete Applied Mathematics. 2025;373:301-315. doi:10.1016/j.dam.2025.05.010

BibTeX
@article{Zhou2025,
  author = {Zhou, Mingchao and Zhang, Zhao},
  title = {Approximation algorithm for prize-collecting weighted set cover with fairness constraints},
  journal = {Discrete Applied Mathematics},
  year = {2025},
  volume = {373},
  pages = {301--315},
  doi = {10.1016/j.dam.2025.05.010}
}
Kostenlos starten →