Capacitated k-Center Problem with Vertex Weights

DOI10.4230/LIPICS.FSTTCS.2016.8zbMath1391.68042OpenAlexW2577136449MaRDI QIDQ4636555

Aounon Kumar

Publication date: 19 April 2018

Full work available at URL: http://dblp.uni-trier.de/db/conf/fsttcs/fsttcs2016.html#Kumar16

zbMATH Keywords

\(k\)-centerapproximation hardnessgadget reduction

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (1)

Kantorovich–Rubinstein Distance Minimization: Application to Location Problems

This page was built for publication: Capacitated k-Center Problem with Vertex Weights