A distributed approximation algorithm for fault-tolerant metric facility location
DOI10.1142/S0129054111008544zbMATH Open1233.90214OpenAlexW1964104642MaRDI QIDQ3173932FDOQ3173932
Publication date: 10 October 2011
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054111008544
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
Approximation algorithms (68W25) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15) Distributed systems (68M14) Discrete location and assignment (90B80)
Cites Work
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
- Title not available (Why is that?)
- Greedy Strikes Back: Improved Facility Location Algorithms
- Improved Combinatorial Algorithms for Facility Location Problems
- Heuristics for the fixed cost median problem
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- A constant factor approximation algorithm for the fault-tolerant facility location problem
- Fault-tolerant facility location
Cited In (2)
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)
