A linear time randomizing algorithm for searching ranked functions (Q1101237): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3908461 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Applying Parallel Computation Algorithms in the Design of Serial Algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Weighted Euclidean 1-Center Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An O(nlogn) randomizing algorithm for the weighted euclidean 1-center problem / rank | |||
Normal rank |
Revision as of 16:53, 18 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A linear time randomizing algorithm for searching ranked functions |
scientific article |
Statements
A linear time randomizing algorithm for searching ranked functions (English)
0 references
1987
0 references
Consider a set F of n functions defined on a common interval U. A ranked function over F is defined from the functions of F by using order information such as the k largest function, the sum of k largest functions, etc. We give a linear time randomizing algorithmic paradigm for finding local roots, optima, intersection points, etc., of ranked functions. The algorithm is generalized to the cost effective resource allocation problem and to various variants of the parametric knapsack problem.
0 references
searching
0 references
ranked function
0 references
linear time randomizing algorithmic
0 references
cost effective resource allocation
0 references
parametric knapsack problem
0 references