Fault-tolerant facility location

DOI10.1145/1383369.1383382zbMath1445.68356OpenAlexW1967391655MaRDI QIDQ4962756

Chaitanya Swamy, David B. Shmoys

Publication date: 5 November 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1383369.1383382

zbMATH Keywords

facility locationapproximation algorithms\(k\)-median problem

Mathematics Subject Classification ID

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

Related Items (18)

A DISTRIBUTED APPROXIMATION ALGORITHM FOR FAULT-TOLERANT METRIC FACILITY LOCATION ⋮ Improved Approximation Algorithm for Fault-Tolerant Facility Placement ⋮ Constant approximation for fault-tolerant median problems via iterative rounding ⋮ Approximation algorithms for clustering with dynamic points ⋮ Fault-tolerant covering problems in metric spaces ⋮ Hotelling games in fault-prone settings ⋮ New variants of the simple plant location problem and applications ⋮ Approximation algorithms for the fault-tolerant facility location problem with submodular penalties ⋮ Unnamed Item ⋮ Approximation algorithms for the fault-tolerant facility placement problem ⋮ Adding incompatibilities to the simple plant location problem: formulation, facets and computational experience ⋮ Proportional Approval Voting, Harmonic k-median, and Negative Association ⋮ LP-rounding algorithms for the fault-tolerant facility placement problem ⋮ Unnamed Item ⋮ The double-assignment plant location problem with co-location ⋮ Mixed fault tolerance in server assignment: combining reinforcement and backup ⋮ A unified framework for clustering constrained data without locality property ⋮ Improved approximation algorithms for constrained fault-tolerant resource allocation

This page was built for publication: Fault-tolerant facility location