Choosing subsets with maximum weighted average.
D. Eppstein and
D. S. Hirschberg.
Tech. Rep. 95-12, ICS, UCI, 1995.
5th MSI Worksh. on Computational Geometry, 1995, pp. 7–8.
J. Algorithms 24: 177–193, 1997, doi:10.1006/jagm.1996.0849.
Uses geometric optimization techniques to find, among \(n\) weighted values, the \(k\) to drop so as to maximize the weighted average of the remaining values. The feasibility test for the corresponding decision problem involves \(k\)-sets in a dual line arrangement.