A deterministic algorithm for fitting a step function to a weighted point-set
Fournier, Hervé · Vigneron, Antoine
Original · EN
Given a set of n points in the plane, each point having a positive weight, and an integer k>0, we present an optimal O(n n)-time deterministic algorithm to compute a step function with k steps that minimizes the maximum weighted vertical distance to the input points. It matches the expected time bound of the best known randomized algorithm for this problem. Our approach relies on Cole's improved parametric searching technique.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.