2 papers
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
Constant-Factor Approximations for Doubly Constrained Fair k-Center, k-Median and k-Means
Nicole Funk, Annika Hennes, Johanna Hillebrand +1
We study discrete k-clustering problems in general metric spaces that are constrained by a combination of two different fairness conditions within the demographic fairness model. G…