A stochastic analog to Chebyshev centers and optimal average case algorithms (Q1117550)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A stochastic analog to Chebyshev centers and optimal average case algorithms |
scientific article; zbMATH DE number 4092442
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A stochastic analog to Chebyshev centers and optimal average case algorithms |
scientific article; zbMATH DE number 4092442 |
Statements
A stochastic analog to Chebyshev centers and optimal average case algorithms (English)
0 references
1989
0 references
We study a stochastic analogue to Chebyshev centers in a metric space. We prove several statements concerning the existence and uniqueness of these centers. Similarly as in the worst case these results can be used to prove the existence and uniqueness of optimal average case algorithms. We also show that nonmeasurable algorithms are not better than measurable ones.
0 references
stochastic analogue to Chebyshev centers in a metric space
0 references
optimal average case algorithms
0 references
