Corpus ID: 234357489

Parameterized Algorithms for Diverse Multistage Problems

@article{Kellerhals2021ParameterizedAF,
  title={Parameterized Algorithms for Diverse Multistage Problems},
  author={Leon Kellerhals and Malte Renken and P. Zschoche},
  journal={ArXiv},
  year={2021},
  volume={abs/2105.04856}
}
The world is rarely static — many problems need not only be solved once but repeatedly, under changing conditions. This setting is addressed by the “multistage” view on computational problems. We study the “diverse multistage” variant, where consecutive solutions of large variety are preferable to similar ones, e.g. for reasons of fairness or wear minimization. While some aspects of this model have been tackled before, we introduce a framework allowing us to prove that a number of diverse… Expand

References

SHOWING 1-10 OF 45 REFERENCES
LP-based algorithms for multistage minimization problems
Multistage Matchings
A Multistage View on 2-Satisfiability
Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
Multistage Vertex Cover
Splitters and near-optimal derandomization
Multistage Knapsack
Multistage Committee Election
...
1
2
3
4
5
...