8 citations · 11 across the 6 of their papers we have counts for
3 papers · 1 filter
Robust Online Algorithms for Dynamic Problems
Sebastian Berndt, Valentin Dreismann, Kilian Grage +2
Online algorithms that allow a small amount of migration or recourse have been intensively studied in the last years. They are essential in the design of competitive algorithms for…
Positive-Instance Driven Dynamic Programming for Graph Searching
Max Bannach, Sebastian Berndt
Research on the similarity of a graph to being a tree - called the treewidth of the graph - has seen an enormous rise within the last decade, but a practically fast algorithm for t…
Online Bin Covering with Limited Migration
Sebastian Berndt, Leah Epstein, Klaus Jansen +3
Semi-online models where decisions may be revoked in a limited way have been studied extensively in the last years. This is motivated by the fact that the pure online model is ofte…