Robust two-dose vaccination schemes and the directed b-matching problem

In light of the recent pandemic and the shortage of vaccinations during their roll-out, questions arose regarding the best strategy to achieve immunity throughout the population by adjusting the time gap between the two necessary vaccination doses. This strategy has already been studied from differe...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Discrete Applied Mathematics Jg. 356; S. 369 - 392
Hauptverfasser: Segschneider, Jenny, Koster, Arie M.C.A.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier B.V 30.10.2024
Schlagworte:
Computational complexity
Directed matching
Graph and network algorithms
Optimal vaccination scheduling
Robust optimization
Robust optimization
Directed matching
Graph and network algorithms
Computational complexity
Optimal vaccination scheduling
ISSN:0166-218X, 1872-6771
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In light of the recent pandemic and the shortage of vaccinations during their roll-out, questions arose regarding the best strategy to achieve immunity throughout the population by adjusting the time gap between the two necessary vaccination doses. This strategy has already been studied from different angles by various researches. However, the deliveries of vaccination doses also proved to be highly uncertain, with manufacturers not being able to deliver the promised amount of vaccines on time. In this paper, we study the robust version of this problem and its generalization to matchings on arbitrary graphs. By exploring the problem, we show that it is weakly NP-hard for a constant number of scenarios and strongly NP-hard else. Further, we propose a pseudo-polynomial algorithm for the weakly NP-hard subproblem with a constant number of scenarios and time between both doses. Finally, we perform computational experiments to better understand the behavior of the problem.
ISSN:0166-218X
1872-6771
DOI:10.1016/j.dam.2024.06.029