5 citations · 5 across the 4 of their papers we have counts for
Showing 2026 · cs.DSShow all
2 papers · 2 filters
cs.DS2026
Approximation Algorithms for the Traveling Thief Problem
Jan Eube, Kelin Luo, Heiko Röglin +1
The Traveling Thief Problem (TTP) combines the Traveling Salesperson Problem with the Knapsack Problem. In this problem, a finite metric space is given, and at each location an ite…
cs.DS2026
Effective Traveling for Metric Instances of the Traveling Thief Problem
Jan Eube, Kelin Luo, Aneta Neumann +2
The Traveling Thief Problem (TTP) is a multi-component optimization problem that captures the interplay between routing and packing decisions by combining the classical Traveling S…