Approximation Algorithms for Clustering Problems with Lower Bounds and Outliers

DOI10.4230/LIPIcs.ICALP.2016.69zbMath1395.90172arXiv1608.01700OpenAlexW2963988193MaRDI QIDQ4598208

Chaitanya Swamy, Sara Ahmadian

Publication date: 19 December 2017

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

zbMATH Keywords

Lagrangian relaxationprimal-dual methodapproximation algorithms\(k\)-center problemsfacililty-location problemsminimizing sum of radii

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Approximation algorithms (68W25)

Related Items (6)

Algorithms for covering multiple submodular constraints and applications ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Tight FPT approximation for constrained \(k\)-center and \(k\)-supplier ⋮ On the cost of essentially fair clusterings ⋮ Faster balanced clusterings in high dimension

This page was built for publication: Approximation Algorithms for Clustering Problems with Lower Bounds and Outliers