Approximation algorithms for the lower-bounded \(k\)-median and its generalizations
type: Item
instance of: scholarly article
title: Approximation algorithms for the lower-bounded \(k\)-median and its generalizations
DOI: 10.1007/978-3-030-58150-3_51
author: Lu Han
author: Chunlin Hao
author: Zhenning Zhang
author: Chenchen Wu
publication date: 2021-04-21T00:00:00Z
Mathematics Subject Classification ID: 68Rxx
zbMATH DE Number: 7336140
zbMATH Keywords: \(k\)-median
zbMATH Keywords: lower bounds
zbMATH Keywords: approximation algorithm
zbMATH Keywords: bi-criteria
MaRDI profile type: Publication
full work available at URL: 978-3-030-58150-3 51
OpenAlex ID: W3082506605
cites work: Achieving anonymity via clustering
cites work: Improved Approximation Guarantees for Lower-Bounded Facility Location
cites work: Local Search Heuristics for k-Median and Facility Location Problems
cites work: An improved approximation algorithm for knapsack median using sparsification
cites work: An Improved Approximation for k -Median and Positive Correlation in Budgeted Optimization
cites work: A constant-factor approximation algorithm for the \(k\)-median problem
cites work: Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
cites work: A new greedy approach for facility location problems
cites work: Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
cites work: A 1.488 approximation algorithm for the uncapacitated facility location problem
cites work: On Facility Location with General Lower Bounds
cites work: Approximating \(k\)-median via pseudo-approximation
cites work: Q4526991
cites work: Q4737531
cites work: Lower-bounded facility location
cites work: An approximation algorithm for \(k\)-facility location problem with linear penalties using local search scheme
cites work: A new approximation algorithm for the \(k\)-facility location problem
description: scientific article; zbMATH DE number 7336140