Linear-time fitting of a k-step function
Document Type
Conference Article
Publication Title
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Abstract
Given a set of n weighted points on the x-y plane, we want to find a step function consisting of k horizontal steps such that the maximum vertical weighted distance from any point to a step is minimized. We solve this problem in O(n) time when k is a constant. Our approach relies on the prune-and-search technique, and can be adapted to design similar linear time algorithms to solve the line-constrained k-center problem and the size-k histogram construction problem as well.
First Page
85
Last Page
96
DOI
10.1007/978-3-319-29221-2_8
Publication Date
1-1-2016
Recommended Citation
Bhattacharya, Binay; Das, Sandip; and Kameda, Tsunehiko, "Linear-time fitting of a k-step function" (2016). Conference Articles. 738.
https://digitalcommons.isical.ac.in/conf-articles/738
