A greedy facility location algorithm analyzed using dual fitting
From MaRDI portal
Recommendations
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
- Greedy Strikes Back: Improved Facility Location Algorithms
- An 0. 828-approximation algorithm for the uncapacitated facility location problem
- scientific article; zbMATH DE number 1303608
- scientific article; zbMATH DE number 1303535
Cited in
(14)- Worst-case analysis of the greedy algorithm for a generalization of the maximum \(p\)-facility location problem
- Greedy algorithms for the single-demand facility location problem
- Quantifying spatial misallocation in centrally provided public goods
- LP-based approximation for uniform capacitated facility location problem
- Improved approximation algorithms for constrained fault-tolerant resource allocation
- A new approximation algorithm for the k-facility location problem
- An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
- The facility location problem with general cost functions
- Integrated Supply Chain Management via Randomized Rounding
- Respecting lower bounds in uniform lower and upper bounded facility location problem
- Approximation algorithm for dynamic facility location problem
- Recovery guarantees for exemplar-based clustering
- Randomized priority algorithms
This page was built for publication: A greedy facility location algorithm analyzed using dual fitting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4780788)