2 papers
cs.DS2025
Graph Exploration with Edge Weight Estimates
Matthias Gehnen, Ralf Klasing, Ãmile Naquin
In the Travelling Salesman Problem, every vertex of an edge-weighted graph has to be visited by an agent who traverses the edges of the graph. In this problem, it is usually assume…
cs.DS2024
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…