Improved Approximation Algorithm for Fault-Tolerant Facility Placement

DOI10.1007/978-3-319-18263-6_6zbMath1457.68311arXiv1311.6615OpenAlexW1915670320MaRDI QIDQ3453283

Bartosz Rybicki, Jaroslaw Byrka

Publication date: 20 November 2015

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1311.6615

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Approximation algorithms (68W25)

Related Items (2)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• LP-rounding algorithms for the fault-tolerant facility placement problem
• Approximation algorithms for the fault-tolerant facility placement problem
• A 1.488 approximation algorithm for the uncapacitated facility location problem
• Improved Approximation Algorithm for Fault-Tolerant Facility Placement
• Dependent rounding and its applications to approximation algorithms
• Fault-Tolerant Facility Location: A Randomized Dependent LP-Rounding Algorithm
• A new greedy approach for facility location problems
• The Fault-Tolerant Facility Allocation Problem
• Greedy Strikes Back: Improved Facility Location Algorithms
• Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
• Fault-tolerant facility location
• Analytical approach to parallel repetition
• An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem

This page was built for publication: Improved Approximation Algorithm for Fault-Tolerant Facility Placement