An improved approximation algorithm for knapsack median using sparsification
type: Item
instance of: scholarly article
title: An improved approximation algorithm for knapsack median using sparsification
zbMATH Open document ID: 1390.68759
author: Bartosz Rybicki
author: Joachim Spoerhase
author: Aravind Srinivasan
author: Khoa Trinh
author: Jaroslaw Byrka
author: Thomas W. Pensyl
published in: Algorithmica
publication date: 2018-05-23T00:00:00Z
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 68W20
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6872020
zbMATH Keywords: approximation algorithm
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: randomized algorithm
zbMATH Keywords: facility-location problems
MaRDI profile type: Publication
full work available at URL: s00453-017-0294-4
OpenAlex ID: W2787947809
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 (extended abstract)
cites work: A Dependent LP-Rounding Approach for the k-Median Problem
cites work: Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
cites work: Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
cites work: Q5365103
cites work: Q5743439
cites work: Approximating k-median via pseudo-approximation
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: Improved Approximation Algorithms for Matroid and Knapsack Median Problems and Applications
cites work: The Design of Approximation Algorithms
DOI: 10.1007/S00453-017-0294-4
description: scientific article; zbMATH DE number 6872020