Kamyar Khodamoradi — accepted AI-conference papers

2026

The Computational Complexity of Almost Stable Clustering with Penalties

Farnam Mansouri, Sandra Zilles, Kamyar Khodamoradi

IJCAI 2026

We investigate the complexity of stable (or perturbation-resilient) instances of k-Means and k-Median clustering problems in metrics with small doubling dimension. While these problems have been extensively studied under multiplicative perturbation resilience in low-dimensional Euclidean spaces, we

Cited by 0 Scholar ↗

2023

A Constant-Factor Approximation Algorithm for Reconciliation $k$-Median

Joachim Spoerhase, Kamyar Khodamoradi, Benedikt Riegel, Bruno Ordozgoiti, Aristides Gionis

AISTATS 2023poster

In the reconciliation $k$-median problem we ask to cluster a set of data points by picking $k$ cluster centers so as to minimize the sum of distances of the data points to their cluster centers plus the sum of pairwise distances between the centers. The problem, which is a variant of classic $k$-med…

Cited by 0 Source ↗PDF ↗Scholar ↗