An Optimal Algorithm for the Continuous/Discrete Weighted 2-Center Problem in Trees
From MaRDI portal
Publication:3525757
DOI10.1007/11682462_19zbMath1145.68581OpenAlexW1508209142MaRDI QIDQ3525757
Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi
Publication date: 18 September 2008
Published in: LATIN 2006: Theoretical Informatics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11682462_19
Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (9)
A quadratic time exact algorithm for continuous connected 2-facility location problem in trees ⋮ The multi-service center problem ⋮ Constant work-space algorithms for facility location problems ⋮ The two-center problem of uncertain points on a real line ⋮ Efficient algorithms for the one-dimensional \(k\)-center problem ⋮ An optimal algorithm for the weighted backup 2-center problem on a tree ⋮ Computing the Line-Constrained k-center in the Plane for Small k ⋮ Optimal algorithms for the path/tree-shaped facility location problems in trees ⋮ The weighted \(k\)-center problem in trees for fixed \(k\)
This page was built for publication: An Optimal Algorithm for the Continuous/Discrete Weighted 2-Center Problem in Trees
