A new approximation algorithm for the k-facility location problem
From MaRDI portal
A new approximation algorithm for the \(k\)-facility location problem
Recommendations
Cites work
- A new greedy approach for facility location problems
- Analysis of a Local Search Heuristic for Facility Location Problems
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
- Greedy Strikes Back: Improved Facility Location Algorithms
- scientific article; zbMATH DE number 1670526 (Why is no real title available?)
- scientific article; zbMATH DE number 44281 (Why is no real title available?)
- scientific article; zbMATH DE number 4123493 (Why is no real title available?)
- scientific article; zbMATH DE number 1947060 (Why is no real title available?)
- scientific article; zbMATH DE number 1833407 (Why is no real title available?)
- Local Search Heuristics for k-Median and Facility Location Problems
- The facility location problem with general cost functions
Cited in
(54)- The reverse greedy algorithm for the metric k-median problem
- A local search approximation algorithm for the uniform capacitated k-facility location problem
- An approximation algorithm for soft capacitated k-facility location problem
- Local search algorithm for the squared metric \(k\)-facility location problem with linear penalties
- An improved per-scenario bound for the two-stage stochastic facility location problem
- Approximation algorithms for the lower-bounded \(k\)-median and its generalizations
- Approximation algorithms for the lower-bounded knapsack median problem
- Improved approximation algorithms for solving the squared metric k-facility location problem
- An improved approximation algorithm for squared metric \(k\)-facility location
- On stochastic k-facility location
- LP-based approximation for uniform capacitated facility location problem
- Approximation algorithms for spherical \(k\)-means problem using local search scheme
- Mobile facility location: combinatorial filtering via weighted occupancy
- Local search approximation algorithms for the sum of squares facility location problems
- LP-rounding approximation algorithms for two-stage stochastic fault-tolerant facility location problem
- An approximation algorithm for the facility location problem with lexicographic minimax objective
- An approximation algorithm for the \(n\)th power metric facility location problem with linear penalties
- Local search approximation algorithms for the k-means problem with penalties
- An approximation algorithm for the dynamic facility location problem with outliers
- Approximation algorithms for the fault-tolerant facility location problem with penalties
- Approximation algorithms for median hub location problems
- Approximation algorithms for hard capacitated \(k\)-facility location problems
- Combinatorial approximation algorithms for the robust facility location problem with penalties
- Approximation algorithms for the stochastic priority facility location problem
- An approximation algorithm for the two-stage distributionally robust facility location problem
- Approximation Algorithms for the Robust Facility Location Problem with Penalties
- Analysis of a local search algorithm for the k-facility location problem
- Local search algorithms for \(k\)-median and \(k\)-facility location problems with linear penalties
- Improved approximation algorithms for the robust fault-tolerant facility location problem
- Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem
- scientific article; zbMATH DE number 2086926 (Why is no real title available?)
- Primal-dual approximation algorithm for the two-level facility location problem via a dual quasi-greedy approach
- A primal-dual 3-approximation algorithm for the stochastic facility location problem with submodular penalties
- A per-scenario bound for the two-stage stochastic facility location problem with linear penalty
- Lagrangian relaxation for the \(k\)-median problem: new insights and continuity properties
- Theory and Applications of Models of Computation
- A local search approximation algorithm for a squared metric \(k\)-facility location problem
- Incremental facility location problem and its competitive algorithms
- An approximation algorithm for the k-level stochastic facility location problem
- An approximation algorithm for the k-level capacitated facility location problem
- Approximation schemes for k-facility location
- A combinatorial approximation algorithm for \(k\)-level facility location problem with submodular penalties
- A primal-dual approximation algorithm for stochastic facility location problem with service installation costs
- Respecting lower bounds in uniform lower and upper bounded facility location problem
- Towards a theoretical understanding of why local search works for clustering with fair-center representation
- A polynomial-time exact algorithm for the connected k-facility location problem on trees
- Fault-tolerant concave facility location problem with uniform requirements
- An approximation algorithm for multi-allocation hub location problems
- An approximation algorithm for \(k\)-facility location problem with linear penalties using local search scheme
- An approximation algorithm for the stochastic fault-tolerant facility location problem
- Improved approximation algorithms for the facility location problems with linear/submodular penalties
- A cost-sharing method for the multi-level economic lot-sizing game
- Approximation algorithms for the priority facility location problem with penalties
- A new approximation algorithm for the multilevel facility location problem
This page was built for publication: A new approximation algorithm for the \(k\)-facility location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2382290)
