Keyword: Minimax regret

Found 1 papers in total
An O(nlogn) version of the Averbakh–Berman algorithm for the robust median of a tree
An O(nlogn) version of the Averbakh–Berman algorithm for the robust median of a tree
2008,
We show that the minmax regret median of a tree can be found in O( n log n ) time....
Papers per page: