A distributed approximation algorithm for fault-tolerant metric facility location
From MaRDI portal
Publication:3173932
Recommendations
- scientific article; zbMATH DE number 1670540
- An approximation algorithm for the fault tolerant metric facility location problem
- Fault-tolerant facility location
- A distributed O(1)-approximation algorithm for the uniform facility location problem
- Improved algorithms for fault tolerant facility location
Cites work
- scientific article; zbMATH DE number 44281 (Why is no real title available?)
- A constant factor approximation algorithm for the fault-tolerant facility location problem
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Fault-tolerant facility location
- Greedy Strikes Back: Improved Facility Location Algorithms
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
- Heuristics for the fixed cost median problem
- Improved Combinatorial Algorithms for Facility Location Problems
Cited in
(9)- scientific article; zbMATH DE number 1670540 (Why is no real title available?)
- Return of the primal-dual, distributed metric facility location
- Large-scale distributed algorithms for facility location with outliers
- Sub-logarithmic distributed algorithms for metric facility location
- An approximation algorithm for the fault tolerant metric facility location problem
- A polynomial-time approximation scheme for fault-tolerant distributed storage
- Super-fast distributed algorithms for metric facility location
- Facility location, distributed approximation
- A distributed O(1)-approximation algorithm for the uniform facility location problem
This page was built for publication: A distributed approximation algorithm for fault-tolerant metric facility location
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3173932)