Approximating capacitated k-median with (1 + ∊)k open facilities
From MaRDI portal
Publication:4575635
DOI10.1137/1.9781611974331.ch56zbMath1418.90141arXiv1411.5630OpenAlexW4256246662MaRDI QIDQ4575635
Publication date: 16 July 2018
Published in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1411.5630
Related Items (22)
A Technique for Obtaining True Approximations for k-Center with Covering Constraints ⋮ Improved parameterized approximation for balanced \(k\)-median ⋮ An Approximation Algorithm for Uniform Capacitated k-Median Problem with $$1+\epsilon $$ Capacity Violation ⋮ Approximation algorithms for clustering with dynamic points ⋮ LP-based approximation for uniform capacitated facility location problem ⋮ On colorful vertex and edge cover problems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Capacitated facility location with outliers/penalties ⋮ An approximation algorithm for soft capacitated \(k\)-facility location problem ⋮ On the cost of essentially fair clusterings ⋮ FPT Approximation for Constrained Metric k-Median/Means ⋮ Unnamed Item ⋮ Robust \(k\)-center with two types of radii ⋮ Constant-Factor FPT Approximation for Capacitated k-Median ⋮ Robust \(k\)-center with two types of radii ⋮ Generalized Center Problems with Outliers ⋮ Constant Approximation Algorithm for Nonuniform Capacitated Multi-Item Lot Sizing via Strong Covering Inequalities ⋮ Constant factor approximation algorithm for uniform hard capacitated knapsack median problem ⋮ On parameterized approximation algorithms for balanced clustering ⋮ To close is easier than to open: dual parameterization to \(k\)-median ⋮ A technique for obtaining true approximations for \(k\)-center with covering constraints
This page was built for publication: Approximating capacitated k-median with (1 + ∊)k open facilities
