Fault tolerant \(K\)-center problems

DOI10.1016/S0304-3975(98)00222-9zbMath0944.68141MaRDI QIDQ1575549

Samir Khuller, Yoram J. Sussmann, Robert Pless

Publication date: 21 August 2000

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

zbMATH Keywords

facility location; fault-tolerance; approximation algorithms; \(K\)-center

Mathematics Subject Classification ID

90B85: Continuous location

90C59: Approximation methods and heuristics in mathematical programming

68W25: Approximation algorithms

68M15: Reliability, testing and fault tolerance of networks and computer systems

Related Items

A simple greedy approximation algorithm for the minimum connected \(k\)-center problem, The \(p\)-neighbor \(k\)-center problem, Matroid and knapsack center problems, The fault-tolerant capacitated \(K\)-center problem, Fault tolerant \(K\)-center problems, \(k\)-center problems with minimum coverage, Robust fault tolerant uncapacitated facility location, Asymmetry in \(k\)-center variants, One-way and round-trip center location problems

Cites Work

• The \(p\)-neighbor \(k\)-center problem
• 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
• A Best Possible Heuristic for the k-Center Problem
• `` Strong NP-Completeness Results
• How to Allocate Network Centers
• The capacitated K-center problem
• Bottleneck extrema