O(n) algorithms for discrete n-point approximation by quasi-convex functions (Q2266345): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:35, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | O(n) algorithms for discrete n-point approximation by quasi-convex functions |
scientific article |
Statements
O(n) algorithms for discrete n-point approximation by quasi-convex functions (English)
0 references
1984
0 references
This article considers the problem of approximating a function defined on a finite set of \((n+1)\) points by quasi-convex functions defined there and constructs linear time (O(n)) algorithms for computation of optimal solutions.
0 references
discrete n-point approximation by quasi-convex functions
0 references
linear time algorithms
0 references
optimal solutions
0 references
