Approximation algorithms for the lower-bounded knapsack median problem

DOI10.1007/978-3-030-57602-8_11zbMath1485.90111OpenAlexW3048168606MaRDI QIDQ2039651

Chunlin Hao, Zhenning Zhang, Lu Han, Chen-Chen Wu

Publication date: 5 July 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-57602-8_11

zbMATH Keywords

approximation algorithmlower boundsknapsack median

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An improved approximation algorithm for knapsack median using sparsification
• A constant-factor approximation algorithm for the \(k\)-median problem
• A 1.488 approximation algorithm for the uncapacitated facility location problem
• A new approximation algorithm for the \(k\)-facility location problem
• Approximating $k$-Median via Pseudo-Approximation
• Improved Approximation Guarantees for Lower-Bounded Facility Location
• The Collinearity Problem in Linear Regression. The Partial Least Squares (PLS) Approach to Generalized Inverses
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• A new greedy approach for facility location problems
• Local Search Heuristics for k-Median and Facility Location Problems
• Development and validation of brief measures of positive and negative affect: The PANAS scales.
• An Improved Approximation for k -Median and Positive Correlation in Budgeted Optimization
• On Facility Location with General Lower Bounds

This page was built for publication: Approximation algorithms for the lower-bounded knapsack median problem