5 citations · 6 across the 4 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2019
The Complexity of Packing Edge-Disjoint Paths
Jan Dreier, Janosch Fuchs, Tim A. Hartmann +4
We introduce and study the complexity of Path Packing. Given a graph and a list of paths, the task is to embed the paths edge-disjoint in . This generalizes the well known H…
cs.CC2018
Reoptimization of Parameterized Problems
Hans-Joachim Böckenhauer, Elisabet Burjons, Martin Raszyk +1
Parameterized complexity allows us to analyze the time complexity of problems with respect to a natural parameter depending on the problem. Reoptimization looks for solutions or ap…