The Priority k-Median Problem
From MaRDI portal
Recommendations
- A constant-factor approximation algorithm for the k-median problem
- A Constant Factor Approximation Algorithm for Fault-Tolerant k-Median
- The matroid median problem
- A constant-factor approximation algorithm for the \(k\)-median problem (extended abstract)
- Facility Location with Matroid or Knapsack Constraints
Cites work
- scientific article; zbMATH DE number 1187151 (Why is no real title available?)
- scientific article; zbMATH DE number 44281 (Why is no real title available?)
- scientific article; zbMATH DE number 1303535 (Why is no real title available?)
- scientific article; zbMATH DE number 1559542 (Why is no real title available?)
- A constant-factor approximation algorithm for the \(k\)-median problem (extended abstract)
- Approximation algorithms for NP-hard problems.
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Automata, Languages and Programming
- Facility location with service installation costs
- Improved Combinatorial Algorithms for Facility Location Problems
- Local search heuristic for k-median and facility location problems
- On the approximability of some network design problems
- The Priority k-Median Problem
Cited in
(5)
This page was built for publication: The Priority k-Median Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458823)