scientific article; zbMATH DE number 7053318
From MaRDI portal
Publication:5743439
zbMath1422.68300MaRDI QIDQ5743439
Publication date: 10 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=2095182
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Combinatorial optimization (90C27) Discrete location and assignment (90B80) Approximation algorithms (68W25)
Related Items (7)
Matroid and knapsack center problems ⋮ Constant approximation for fault-tolerant median problems via iterative rounding ⋮ Approximation algorithms for clustering with dynamic points ⋮ On clustering with discounts ⋮ An improved approximation algorithm for knapsack median using sparsification ⋮ Approximation algorithms for the lower-bounded knapsack median problem ⋮ Constant factor approximation algorithm for uniform hard capacitated knapsack median problem
Cites Work
- A constant-factor approximation algorithm for the \(k\)-median problem
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Budgeted Red-Blue Median and Its Generalizations
- Local search heuristic for k-median and facility location problems
- Improved Combinatorial Algorithms for Facility Location Problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication:
