scientific article; zbMATH DE number 7651201

DOI10.4230/LIPICS.ESA.2020.62MaRDI QIDQ5874534zbMATH OpenFDO

Authors Tanmay Inamdar, Kasturi Varadarajan

Publication date 7 February 2023

zbMATH Keywords

capacitated clusteringsum-of-radii clustering

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A Best Possible Heuristic for the k-Center Problem
• A constant-factor approximation algorithm for the \(k\)-median problem
• An Improved Approximation for k -Median and Positive Correlation in Budgeted Optimization
• An approximation algorithm for uniform capacitated \(k\)-median problem with \(1+\epsilon\) capacity violation
• Approximating \(k\)-median with non-uniform capacities
• Approximating capacitated \(k\)-median with \((1 + \epsilon)k\) open facilities
• Capacitated covering problems in geometric spaces
• Clustering to minimize the maximum intercluster distance
• Clustering to minimize the sum of cluster diameters
• Constant approximation for \(k\)-median and \(k\)-means with outliers via iterative rounding
• Constant approximation for capacitated \(k\)-median with \((1+\epsilon)\)-capacity violation
• Constant-Factor FPT Approximation for Capacitated k-Median
• LP-based algorithms for capacitated facility location
• On metric clustering to minimize the sum of radii
• On minimum sum of radii and diameters clustering
• On the fixed-parameter tractability of capacitated clustering
• On uniform capacitated \(k\)-median beyond the natural LP relaxation
• Parameterized algorithms
• The Capacitated K-Center Problem

Cited in

(2)

• FPT approximation for capacitated clustering with outliers
• Approximating fair \(k\)-min-sum-radii in Euclidean space

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 Q5874534)