An improved approximation algorithm for the metric uncapacitated facility location problem
From MaRDI portal
Recommendations
- Improved approximation algorithms for metric facility location problems
- Approximation Algorithms for Metric Facility Location Problems
- A 1.488 approximation algorithm for the uncapacitated facility location problem
- A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
- A new approximation algorithm for the k-facility location problem
Cited in
(68)- An improved approximation algorithm for uncapacitated facility location problem with penalties
- A cross-monotonic cost sharing method for the facility location game with service installation costs
- An improved branch \& bound method for the uncapacitated competitive location problem
- A local search approximation algorithm for the uniform capacitated k-facility location problem
- Approximation algorithms for the robust facility leasing problem
- Improved approximation algorithms for multilevel facility location problems
- Approximation algorithms for the fault-tolerant facility placement problem
- A 1.488 approximation algorithm for the uncapacitated facility location problem
- Approximation algorithms for the lower-bounded \(k\)-median and its generalizations
- Approximating the \(\tau\)-relaxed soft capacitated facility location problem
- An approximation algorithm for the k-level facility location problem with outliers
- Concave connection cost facility location and the star inventory routing problem
- LP-based approximation for uniform capacitated facility location problem
- Soft-capacitated facility location game
- An acceleration of Erlenkotter-Körkel's algorithms for the uncapacitated facility location problem
- LP-rounding approximation algorithms for two-stage stochastic fault-tolerant facility location problem
- Improved approximation algorithms for constrained fault-tolerant resource allocation
- An approximation algorithm for the \(n\)th power metric facility location problem with linear penalties
- A new approximation algorithm for the k-facility location problem
- Approximation algorithm for uniform bounded facility location problem
- Approximation algorithms for the fault-tolerant facility location problem with penalties
- Approximation algorithm for squared metric two-stage stochastic facility location problem
- A primal-dual approximation algorithm for the facility location problem with submodular penalties
- The approximation gap for the metric facility location problem is not yet closed
- On the competitive ratio for online facility location
- Incremental algorithms for facility location and \(k\)-median
- Improved approximation algorithm for k-level uncapacitated facility location problem (with penalties)
- Hotelling games in fault-prone settings
- Approximate the lower-bounded connected facility location problem
- Combinatorial approximation algorithms for the robust facility location problem with penalties
- Approximation Algorithms for the Robust Facility Location Problem with Penalties
- On the location and \(p\)-median polytopes
- Approximation algorithm for the uniform bounded facility problem
- A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
- Integrating facility location and production planning decisions
- Approximation Algorithms for Metric Facility Location Problems
- Improved approximation algorithm for fault-tolerant facility placement
- Improved approximation algorithms for uncapacitated facility location
- An approximation algorithm for the risk-adjusted two-stage stochastic facility location problem with penalties
- Improved approximation algorithms for the robust fault-tolerant facility location problem
- Improved approximation algorithms for metric facility location problems
- The facility location problem with general cost functions
- Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
- Approximation algorithms for stochastic and risk-averse optimization
- Approximation algorithm for resource allocation problems with time dependent penalties
- Primal-dual approximation algorithm for the two-level facility location problem via a dual quasi-greedy approach
- LP-rounding algorithms for the fault-tolerant facility placement problem
- scientific article; zbMATH DE number 7378709 (Why is no real title available?)
- Integrated Supply Chain Management via Randomized Rounding
- A distributed O(1)-approximation algorithm for the uniform facility location problem
- On Min-Max r-Gatherings
- Inapproximability of the multi-level uncapacitated facility location problem
- Theory and Applications of Models of Computation
- An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
- Mixed fault tolerance in server assignment: combining reinforcement and backup
- Online facility assignment
- Incremental facility location problem and its competitive algorithms
- Approximation algorithms for the fault-tolerant facility location problem with submodular penalties
- A combinatorial approximation algorithm for \(k\)-level facility location problem with submodular penalties
- On min-max \(r\)-gatherings
- Respecting lower bounds in uniform lower and upper bounded facility location problem
- Buy-at-bulk facility location on trees
- A polynomial-time exact algorithm for the connected k-facility location problem on trees
- An approximation algorithm for k-level squared metric facility location problem with outliers
- Improved approximation algorithms for the facility location problems with linear/submodular penalties
- Recovery guarantees for exemplar-based clustering
- A primal-dual algorithm for online non-uniform facility location
- Approximation algorithm for facility location with service installation costs
This page was built for publication: An improved approximation algorithm for the metric uncapacitated facility location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4737531)
