From the 1 of 4 linked papers with an AI index.
4 papers
Finding Regions of Maximum Circularity in Plane Geometric Graphs
Jan-Henrik Haunert, Joshua Marc Könen, Heiko Röglin +1
The paper investigates how to select faces in a planar polygonal subdivision to maximize a circularity measure (Polsby‑Popper score or its generalization A/P^α), proving weak NP‑ha…
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…
Parameterized Algorithms for the Drone Delivery Problem
Simon Bartlmae, Andreas Hene, Joshua Könen +1
Timely delivery and optimal routing remain fundamental challenges in the modern logistics industry. Building on prior work that considers single-package delivery across networks us…
Parameterized Algorithms for Computing Pareto Sets
Joshua Könen, Heiko Röglin, Tarek Stuck
Dynamic programming over tree decompositions is a common technique in parameterized algorithms. In this paper, we study whether this technique can also be applied to compute Pareto…