Fault-tolerant priority facility location problem

DOI10.1016/J.TCS.2025.115595MaRDI QIDQ6888786zbMATH OpenFDO

Authors Yingying Guo, Runjie Miao, Qiaoliang Li

Publication date 5 December 2025

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2025.115595

zbMATH Keywords

approximation ratiofacility locationfault-toleranceLP-roundingpriority

Mathematics Subject Classification ID

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

Cites work

• A constant factor approximation algorithm for fault-tolerant k-median
• A constant factor approximation algorithm for the fault-tolerant facility location problem
• A survey of healthcare facility location
• Approximation algorithms for the fault-tolerant facility location problem with penalties
• Approximation algorithms for the fault-tolerant facility location problem with submodular penalties
• Approximation algorithms for the priority facility location problem with penalties
• Approximation algorithms for the stochastic priority facility location problem
• Equilibrium store locations when consumers minimize travel time plus waiting time
• Fault tolerant clustering with outliers
• Fault-tolerant facility location
• Multicommodity facility location
• Multiple facility location games with envy ratio
• Robust fault tolerant uncapacitated facility location

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6888786)