Choosing Subsets with Maximum Weighted Average David Eppstein∗

First Page		Document Content
Date: 2001-02-11 22:14:24 Analysis of algorithms Combinatorial optimization Operations research Linear programming Selection algorithm Computational geometry K-set Algorithm Time complexity Mathematics Theoretical computer science Applied mathematics		Choosing Subsets with Maximum Weighted Average David Eppstein∗ Add to Reading List Source URL: www.ics.uci.edu Download Document from Source Website File Size: 183,36 KB Share Document on Facebook

	PDF Document DocID: 1xSAp - View Document
	PDF Document DocID: 1xP7V - View Document
	PDF Document DocID: 1x8Vj - View Document
	PDF Document DocID: 1x2r1 - View Document
	PDF Document DocID: 1wHMX - View Document