2 papers
cs.DS2021
A General Approach to Approximate Multistage Subgraph Problems
Markus Chimani, Niklas Troost, Tilo Wiedera
In a Subgraph Problem we are given some graph and want to find a feasible subgraph that optimizes some measure. We consider Multistage Subgraph Problems (MSPs), where we are given…
cs.DS2020
Approximating Multistage Matching Problems
Markus Chimani, Niklas Troost, Tilo Wiedera
In multistage perfect matching problems we are given a sequence of graphs on the same vertex set and asked to find a sequence of perfect matchings, corresponding to the sequence of…