An O\((n\log n)\) version of the Averbakh-Berman algorithm for the robust median of a tree (Q924878): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:35, 30 January 2024
scientific article
| 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 |
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
