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
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.orl.2007.02.012 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2005183677 / rank | |||
Normal rank | |||
Revision as of 01:16, 20 March 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
