A deterministic algorithm for fitting a step function to a weighted point-set

Computer Science – Data Structures and Algorithms

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

5 pages, 2 figures

Scientific paper

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 \log 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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A deterministic algorithm for fitting a step function to a weighted point-set does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A deterministic algorithm for fitting a step function to a weighted point-set, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A deterministic algorithm for fitting a step function to a weighted point-set will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-93432

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.