scientific article; zbMATH DE number 7651201

DOI10.4230/LIPICS.ESA.2020.62MaRDI QIDQ5874534FDOQ5874534

Authors: Tanmay Inamdar, Kasturi Varadarajan 

Publication date: 7 February 2023

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

zbMATH Keywords

capacitated clusteringsum-of-radii clustering

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

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

Cited In (2)

• Approximating fair \(k\)-min-sum-radii in Euclidean space
• FPT approximation for capacitated 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 Q5874534)