The fault-tolerant capacitated \(K\)-center problem

DOI10.1016/J.TCS.2014.11.017zbMath1317.68135OpenAlexW2178005013MaRDI QIDQ484314

David Peleg, Shiri Chechik

Publication date: 6 January 2015

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.11.017

zbMATH Keywords

fault toleranceapproximation algorithmscapacitated \(K\)-center problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Discrete location and assignment (90B80) Approximation algorithms (68W25) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (6)

Matroid and knapsack center problems ⋮ Hotelling games in fault-prone settings ⋮ Structural parameters, tight bounds, and approximation for \((k, r)\)-center ⋮ Improved approximation algorithms for capacitated fault-tolerant \(k\)-center ⋮ An adaptive probabilistic algorithm for online \(k\)-center clustering ⋮ The capacitated single-source p-center problem in the presence of fixed cost and multilevel capacities using VNS and aggregation technique

Cites Work

• A simple heuristic for the p-centre problem
• Clustering to minimize the maximum intercluster distance
• A heuristic for the p-center problem in graphs
• Easy and hard bottleneck location problems
• Fault tolerant \(K\)-center problems
• Generalized submodular cover problems and applications
• A Best Possible Heuristic for the k-Center Problem
• How to Allocate Network Centers
• The Capacitated K-Center Problem
• Centrality of Trees for Capacitated k-Center
• Bottleneck extrema

This page was built for publication: The fault-tolerant capacitated \(K\)-center problem