A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree (Q2914306): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:12, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree |
scientific article |
Statements
A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree (English)
0 references
25 September 2012
0 references
