1 citations · 1 across the 1 of their papers we have counts for
3 papers
Priority Algorithms with Advice for Disjoint Path Allocation Problems
Hans-Joachim Böckenhauer, Fabian Frei, Silvan Horvath
We analyze the Disjoint Path Allocation problem (DPA) in the priority framework. Motivated by the problem of traffic regulation in communication networks, DPA consists of allocatin…
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…
The Graph Exploration Problem with Advice
Hans-Joachim Böckenhauer, Janosch Fuchs, Walter Unger
Moving an autonomous agent through an unknown environment is one of the crucial problems for robotics and network analysis. Therefore, it received a lot of attention in the last de…