scientific article; zbMATH DE number 7768361

DOI10.4230/LIPICS.APPROX/RANDOM.2021.16arXiv2011.12169MaRDI QIDQ6090888

Sandip Banerjee, Yuval Rabani, Rafail Ostrovsky

Publication date: 20 November 2023

Full work available at URL: https://arxiv.org/abs/2011.12169

Title of this publication is not available (Why is that?)

zbMATH Keywords

clusteringapproximation algorithmsprimal-dual

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (2)

Clustering what matters: optimal approximation for clustering with outliers ⋮ Approximation schemes for Min-Sum \(k\)-Clustering

Recommendations

• Title not available (Why is that?) 👍 👎
• Minimum sum of diameters clustering 👍 👎
• Min sum clustering with penalties 👍 👎
• Minimum sum of squares clustering in a low dimensional space 👍 👎
• Approximation algorithm for min-max correlation clustering problem with outliers 👍 👎
• Approximation Schemes for Clustering with Outliers 👍 👎
• Algorithms – ESA 2005 👍 👎
• Clustering what matters: optimal approximation for clustering with outliers 👍 👎

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6090888)