Graph and network algorithms

Complexity of the Directed Robust b-matching Problem and its Variants on Different Graph Classes

  • Jenny Segschneider
  • Arie M.C.A. Koster
    • Categories Network Optimization, Robust Optimization Tags , , ,

    The b-matching problem is a well-known generalization of the classical matching problem with various applications in operations research and computer science. Given an undirected graph, each vertex v has a capacity b(v), indicating the maximum number of times it can be matched, while edges can also be used multiple times. The problem is solvable in … Read more

    Robust Two-Dose Vaccination Schemes and the Directed b-Matching Problem

  • Jenny Segschneider
  • Arie M.C.A. Koster
    • Categories Applications - OR and Management Sciences, Robust Optimization Tags , , , ,

    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 … Read more