An approximation algorithm for the fault tolerant metric facility location problem

DOI10.1007/s00453-003-1070-1zbMath1138.90416OpenAlexW2762633139MaRDI QIDQ1879244

Yanyan Li

Publication date: 22 September 2004

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-003-1070-1

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80) Approximation algorithms (68W25)

Related Items (13)

Beyond Moulin mechanisms ⋮ Constant approximation for fault-tolerant median problems via iterative rounding ⋮ Approximation algorithms for the fault-tolerant facility location problem with penalties ⋮ Approximation algorithms for the fault-tolerant facility location problem with submodular penalties ⋮ Maximum subset intersection ⋮ Approximation algorithms for the fault-tolerant facility placement problem ⋮ Maximum gradient embeddings and monotone clustering ⋮ Improved approximation algorithms for the robust fault-tolerant facility location problem ⋮ A note on the extension complexity of the knapsack polytope ⋮ LP-rounding algorithms for the fault-tolerant facility placement problem ⋮ Fault-tolerant concave facility location problem with uniform requirements ⋮ LP-rounding approximation algorithms for two-stage stochastic fault-tolerant facility location problem ⋮ An approximation algorithm for the stochastic fault-tolerant facility location problem

This page was built for publication: An approximation algorithm for the fault tolerant metric facility location problem