J. Spoerhase

activity

20102024

most citedBi-Factor Approximation Algorithms for Hard Capacitated

k

-Median Problems

28 citations · 62 across the 18 of their papers we have counts for

collaborators

Showing 2023Show all

3 papers · 1 filter

cs.CC2023

Independent set in $k$ -Claw-Free Graphs: Conditional $χ$ -boundedness and the Power of LP/SDP Relaxations

Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi +1

This paper studies $k$ -claw-free graphs, exploring the connection between an extremal combinatorics question and the power of a convex program in approximating the maximum-weight i…

cs.DS2023★ 1 cited

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…

cs.DS2023

Parameterized Approximation Schemes for Clustering with General Norm Objectives

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

This paper considers the well-studied algorithmic regime of designing a $(1 + ε)$ -approximation algorithm for a $k$ -clustering problem that runs in time $f (k, ε) p o l y (n)$ (sometimes ca…

Independent set in k-Claw-Free Graphs: Conditional χ-boundedness and the Power of LP/SDP Relaxations

Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces

Parameterized Approximation Schemes for Clustering with General Norm Objectives

Independent set in $k$ -Claw-Free Graphs: Conditional $χ$ -boundedness and the Power of LP/SDP Relaxations