scientific article; zbMATH DE number 6820262
From MaRDI portal
Publication:4598213
DOI10.4230/LIPIcs.ICALP.2016.73zbMath1388.68306arXiv1603.02324MaRDI QIDQ4598213
Publication date: 19 December 2017
Full work available at URL: https://arxiv.org/abs/1603.02324
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (18)
Parameterized complexity of categorical clustering with size constraints ⋮ Improved parameterized approximation for balanced \(k\)-median ⋮ LP-based approximation for uniform capacitated facility location problem ⋮ Improved bounds for metric capacitated covering problems ⋮ On coresets for fair clustering in metric and Euclidean spaces and their applications ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Capacitated facility location with outliers/penalties ⋮ A local search approximation algorithm for the uniform capacitated \(k\)-facility location problem ⋮ Parameterized complexity of categorical clustering with size constraints ⋮ Lossy kernelization of same-size clustering ⋮ Recent Developments in Approximation Algorithms for Facility Location and Clustering Problems ⋮ Constant-Factor FPT Approximation for Capacitated k-Median ⋮ Constant factor approximation algorithm for uniform hard capacitated knapsack median problem ⋮ An approximation algorithm for the uniform capacitated \(k\)-means problem ⋮ Lossy kernelization of same-size clustering ⋮ On parameterized approximation algorithms for balanced clustering ⋮ To close is easier than to open: dual parameterization to \(k\)-median
This page was built for publication:
