2 papers
cs.DS2025
Improved fixed-parameter bounds for Min-Sum-Radii and Diameters -clustering and their fair variants
Sandip Banerjee, Yair Bartal, Lee-Ad Gottlieb +1
We provide improved upper and lower bounds for the Min-Sum-Radii (MSR) and Min-Sum-Diameters (MSD) clustering problems with a bounded number of clusters . In particular, we prop…
cs.DS2024
Online Probabilistic Metric Embedding: A General Framework for Bypassing Inherent Bounds
Yair Bartal, Ora N. Fandina, Seeun William Umboh
Probabilistic metric embedding into trees is a powerful technique for designing online algorithms. The standard approach is to embed the entire underlying metric into a tree metric…