The standard dynamic programming solution to finding k-medians on a line with n nodes requires O(kn2) time. Dynamic programming speed-up techniques, e.g., use of the quadrangle inequality or properties of totally monotone matrices, can reduce this to O(kn) time but these techniques are inherently static. The major result of this paper is to show that we can maintain the dynamic programming speedup in an online setting where points are added from left to right on a line. Computing the new k-medians after adding a new point takes only O(k) amortized time and O(k log n) worst case time (simultaneously). Using similar techniques, we can also solve the online k-coverage with uniform coverage on a line problem with the same time bounds. © Springer-Verlag Berlin Heidelberg 2004.
CITATION STYLE
Fleischer, R., Golin, M. J., & Yan, Z. (2004). Online maintenance of k-medians and k-covers on a line. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3111, 102–113. https://doi.org/10.1007/978-3-540-27810-8_10
Mendeley helps you to discover research relevant for your work.