The \(p\)-neighbor \(k\)-center problem

DOI10.1016/S0020-0190(97)00224-XzbMath1338.68290OpenAlexW2023936492MaRDI QIDQ293209

Naveen Garg, R. Ravi, Shiva P. Chaudhuri

Publication date: 9 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S002001909700224X?np=y

zbMATH Keywords

design of algorithmsfacility locationcentersapproximation algorithms

Mathematics Subject Classification ID

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

Related Items (15)

A scalable exact algorithm for the vertex \(p\)-center problem ⋮ Asymmetric \(k\)-center with minimum coverage ⋮ Fault-tolerant covering problems in metric spaces ⋮ GRASP with strategic oscillation for the \(\alpha \)-neighbor \(p\)-center problem ⋮ Clustering with faulty centers ⋮ A robust \(p\)-center problem under pressure to locate shelters in wildfire context ⋮ Exact solution approaches for the discrete α‐neighbor p‐center problem ⋮ Approximability of the dispersed \(\vec{p}\)-neighbor \(k\)-supplier problem ⋮ Improved approximation algorithms for capacitated fault-tolerant \(k\)-center ⋮ \(k\)-center problems with minimum coverage ⋮ Asymmetry in \(k\)-center variants ⋮ A unified framework for clustering constrained data without locality property ⋮ An adaptive probabilistic algorithm for online \(k\)-center clustering ⋮ Fault tolerant \(K\)-center problems ⋮ Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants

Cites Work

• Unnamed Item
• Unnamed Item
• Clustering to minimize the maximum intercluster distance
• A heuristic for the p-center problem in graphs
• Fault tolerant \(K\)-center problems
• A Best Possible Heuristic for the k-Center Problem
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers

This page was built for publication: The \(p\)-neighbor \(k\)-center problem