Parallel Algorithms for Two Phases Deletion Robust Submodular Maximization Under a Matroid Constraint
Journal of the Operations Research Society of China · 08.04.2026
DOI: 10.1007/s40305-026-00675-7 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of the Operations Research Society of China, online erschienen am 08.04.2026. Verfasst von Yuan-Yuan Qiang und 1 weiteren Autor:innen. Die Arbeit nennt 29 Literaturangaben. Gefördert von: National Natural Science Foundation of China, Natural Science Foundation of Shandong Province, Fundamental Research Funds for the Central Universities.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- National Natural Science Foundation of China
- Natural Science Foundation of Shandong Province
- Fundamental Research Funds for the Central Universities
Zitieren
APA
Qiang, Y., & Liu, B. (2026). Parallel Algorithms for Two Phases Deletion Robust Submodular Maximization Under a Matroid Constraint. Journal of the Operations Research Society of China. https://doi.org/10.1007/s40305-026-00675-7
Vancouver
Qiang Y, Liu B. Parallel Algorithms for Two Phases Deletion Robust Submodular Maximization Under a Matroid Constraint. Journal of the Operations Research Society of China. 2026. doi:10.1007/s40305-026-00675-7
BibTeX
@article{Qiang2026,
author = {Qiang, Yuan-Yuan and Liu, Bin},
title = {Parallel Algorithms for Two Phases Deletion Robust Submodular Maximization Under a Matroid Constraint},
journal = {Journal of the Operations Research Society of China},
year = {2026},
doi = {10.1007/s40305-026-00675-7}
}
EUVIMED