A DISTRIBUTED APPROXIMATION ALGORITHM FOR FAULT-TOLERANT METRIC FACILITY LOCATION
From MaRDI portal
Publication:3173932
DOI10.1142/S0129054111008544zbMath1233.90214OpenAlexW1964104642MaRDI QIDQ3173932
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
Discrete location and assignment (90B80) Distributed systems (68M14) Approximation algorithms (68W25) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)
Cites Work
- Unnamed Item
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
- Heuristics for the fixed cost median problem
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Greedy Strikes Back: Improved Facility Location Algorithms
- A constant factor approximation algorithm for the fault-tolerant facility location problem
- Fault-tolerant facility location
- Improved Combinatorial Algorithms for Facility Location Problems
This page was built for publication: A DISTRIBUTED APPROXIMATION ALGORITHM FOR FAULT-TOLERANT METRIC FACILITY LOCATION