4 papers · 1 filter
On the Impact of Stability and the Helly Property on the Dominating Set Problem
Che Cheng, Daniel Mock, Peter Rossmanith
We extend the algorithmic framework of progressive exploration [FabiaÅski et al., STACS 2019], which yields simple, yet surprisingly general and efficient parameterized algorithms…
Solving Partial Dominating Set and Related Problems Using Twin-Width
Jakub Balabán, Daniel Mock, Peter Rossmanith
Partial vertex cover and partial dominating set are two well-investigated optimization problems. While they are -hard on general graphs, they have been shown to be fixed-…
Online Unbounded Knapsack
Hans-Joachim Böckenhauer, Matthias Gehnen, Juraj HromkoviÄ +6
We analyze the competitive ratio and the advice complexity of the online unbounded knapsack problem. An instance is given as a sequence of n items with a size and a value each, and…
Tree Coloring: Random Order and Predictions
Fabian Frei, Matthias Gehnen, Dennis Komm +4
Coloring is a notoriously hard problem, and even more so in the online setting, where each arriving vertex has to be colored immediately and irrevocably. Already on trees, which ar…