The $p$-Center Problem in Tree Networks Revisited
From MaRDI portal
Publication:5369508
DOI10.4230/LIPIcs.SWAT.2016.6zbMath1378.68205arXiv1604.07535OpenAlexW2963518882MaRDI QIDQ5369508
Sandip Das, Tsunehiko Kameda, Zhao Song, Binay K. Bhattacharya, Aritra Banik
Publication date: 17 October 2017
Full work available at URL: https://arxiv.org/abs/1604.07535
Analysis of algorithms (68W40) Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10) Discrete location and assignment (90B80)
Related Items (5)
A quadratic time exact algorithm for continuous connected 2-facility location problem in trees ⋮ The two-center problem of uncertain points on a real line ⋮ The weighted \(k\)-center problem in trees for fixed \(k\) ⋮ An O(n log n)-Time Algorithm for the k-Center Problem in Trees ⋮ An $O(n\log n)$-Time Algorithm for the $k$-Center Problem in Trees
This page was built for publication: The $p$-Center Problem in Tree Networks Revisited
