Abstract
Given a set ofnreal values, each with a positive weight, we wish to find the subset ofn−kvalues having maximum weighted average. This is equivalent to the following form of parametric selection: givennobjects with values decreasing linearly with time, find the time at which then−kmaximum values add to zero. We show that these problems can be solved in timeO(n) (independent ofk). A generalization in which weights are allowed to be negative is NP-complete.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
