Approximation algorithms for the fault-tolerant facility placement problem

DOI10.1016/j.ipl.2011.03.005zbMath1260.68468OpenAlexW2017107620MaRDI QIDQ1944947

Li Yan, Marek Chrobak

Publication date: 28 March 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2011.03.005

zbMATH Keywords

approximation algorithms

Mathematics Subject Classification ID

Approximation algorithms (68W25) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (3)

Improved Approximation Algorithm for Fault-Tolerant Facility Placement ⋮ LP-rounding algorithms for the fault-tolerant facility placement problem ⋮ Improved approximation algorithms for constrained fault-tolerant resource allocation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An approximation algorithm for the fault tolerant metric facility location problem
• Approximation Algorithms for Metric Facility Location Problems
• Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• Fault-Tolerant Facility Location: A Randomized Dependent LP-Rounding Algorithm
• The Fault-Tolerant Facility Allocation Problem
• Greedy Strikes Back: Improved Facility Location Algorithms
• Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
• A constant factor approximation algorithm for the fault-tolerant facility location problem
• Local Search Heuristics for k-Median and Facility Location Problems
• Fault-tolerant facility location
• Improved Combinatorial Algorithms for Facility Location Problems
• An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem

This page was built for publication: Approximation algorithms for the fault-tolerant facility placement problem