An O\((n\log n)\) version of the Averbakh-Berman algorithm for the robust median of a tree (Q924878)
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: An O\((n\log n)\) version of the Averbakh-Berman algorithm for the robust median of a tree |
scientific article; zbMATH DE number 5280648
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An O\((n\log n)\) version of the Averbakh-Berman algorithm for the robust median of a tree |
scientific article; zbMATH DE number 5280648 |
Statements
An O\((n\log n)\) version of the Averbakh-Berman algorithm for the robust median of a tree (English)
0 references
29 May 2008
0 references
minmax regret
0 references
tree median
0 references
robust optimization
0 references
