Showing cs.DSShow all
2 papers · 1 filter
cs.DS2026
Finding Regions of Maximum Circularity in Plane Geometric Graphs
Jan-Henrik Haunert, Joshua Marc Könen, Heiko Röglin +1
A problem that occurs in different applications in geographical information science is to generate compact regions from areas on a map. This is important, e.g., in the context of e…
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…