Online maintenance of \(k\)-medians and \(k\)-covers on a line
From MaRDI portal
Publication:2505498
DOI10.1007/s00453-005-1195-5zbMath1099.68129OpenAlexW2047209281MaRDI QIDQ2505498
Yan Zhang, Mordecai J. Golin, Rudolf Fleischer
Publication date: 26 September 2006
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-005-1195-5
Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Dynamic programming (90C39)
Related Items
Strongly polynomial efficient approximation scheme for segmentation ⋮ Online dynamic programming speedups