J. Spoerhase

activity

20242026

collaborators

3 papers

cs.DS2026

Approximating Traveling Salesman Problems Using a Bridge Lemma

Martin BÃ¶hm, Zachary Friggstad, Tobias MÃ¶mke +1

We give improved approximations for two metric Traveling Salesman Problem (TSP) variants. In Ordered TSP (OTSP) we are given a linear ordering on a subset of nodes $o_1, \ldots, o_…

math.CO2025

Hypergraph Representation via Axis-Aligned Point-Subspace Cover

Oksana Firman, Joachim Spoerhase

We propose a new representation of $k$ -partite, $k$ -uniform hypergraphs, that is, a hypergraph with a partition of vertices into $k$ parts such that each hyperedge contains exactly…

cs.DS2024

Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces

Fateme Abbasi, Sandip Banerjee, JarosÅaw Byrka +6

We consider the well-studied Robust $(k, z)$ -Clustering problem, which generalizes the classic $k$ -Median, $k$ -Means, and $k$ -Center problems. Given a constant $z \geq 1$ , the input…