Back to Results
First PageMeta Content
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

Document Date: 2001-02-11 22:14:24


Open Document

File Size: 183,36 KB

Share Result on Facebook

City

Bern / /

Company

Xerox Corp. / /

Facility

Computer Science University of California / /

IndustryTerm

parallel median-selection algorithm / satisfactory solutions / test algorithm / parametric search technique / easy linear time solution / linear time algorithm / randomized algorithm / binary search / parametric search method / linear programming algorithms / generalized linear programming algorithms / exponential algorithm / polynomial time solution / linear-time algorithm / parametric search / parallel algorithm / generalized linear programming algorithm / correct solution / complicated subexponential algorithms / linear time quickselect algorithm / usual algorithm / /

Organization

Weighted Average David Eppstein∗ Daniel S. Hirschberg Department of Information / National Science Foundation / University of California / Irvine / /

Person

David Eppstein∗ Daniel / max B / Daniel S. Hirschberg / /

ProvinceOrState

California / /

Technology

parallel median-selection algorithm / randomized algorithm / resulting algorithm / same test algorithm / linear time quickselect algorithm / linear programming algorithms / time algorithm / generalized linear programming algorithm / 1 algorithm / parallel algorithm / generalized linear programming algorithms / third algorithm / linear time algorithm / complicated subexponential algorithms / usual algorithm / exponential algorithm / linear-time algorithm / test algorithm / /

SocialTag