3 papers
cs.LG2025
Distance-based Learning of Hypertrees
Shaun Fallat, Kamyar Khodamoradi, David Kirkpatrick +3
We study the problem of learning hypergraphs with shortest-path queries (SP-queries), and present the first provably optimal online algorithm for a broad and natural class of hyper…
cs.CC2025
The Computational Complexity of Almost Stable Clustering with Penalties
Kamyar Khodamoradi, Farnam Mansouri, Sandra Zilles
We investigate the complexity of stable (or perturbation-resilient) instances of and clustering problems in metrics with smal…
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 -Clustering problem, which generalizes the classic -Median, -Means, and -Center problems. Given a constant , the input…