Optimal Algorithms for the Weighted p-Center Problems on the Real Line for Small p

DOI10.1007/978-3-540-73951-7_46zbMath1209.68168OpenAlexW1520854924MaRDI QIDQ3603555

Binay K. Bhattacharya, Qiaosheng Shi

Publication date: 17 February 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73951-7_46

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Continuous location (90B85)

Related Items (10)

Linear-time fitting of a \(k\)-step function ⋮ Geometric p-Center Problems with Centers Constrained to Two Lines ⋮ The two-center problem of uncertain points on a real line ⋮ Efficient algorithms for the one-dimensional \(k\)-center problem ⋮ Computing the center of uncertain points on tree networks ⋮ Linear-Time Fitting of a k-Step Function ⋮ Computing the Line-Constrained k-center in the Plane for Small k ⋮ 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: Optimal Algorithms for the Weighted p-Center Problems on the Real Line for Small p