Efficient Algorithms for the Weighted k-Center Problem on a Real Line
From MaRDI portal
Publication:3104660
DOI10.1007/978-3-642-25591-5_60zbMath1350.68259OpenAlexW149967810MaRDI QIDQ3104660
Publication date: 16 December 2011
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-25591-5_60
Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)
Related Items (4)
Matroid and knapsack center problems ⋮ A scalable exact algorithm for the vertex \(p\)-center problem ⋮ One-dimensional \(k\)-center on uncertain data ⋮ On interval and circular-arc covering problems
This page was built for publication: Efficient Algorithms for the Weighted k-Center Problem on a Real Line