Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Gerth Stlting Brodal
Information about the author Gerth Stlting Brodal will soon be added to the site.
Found
2 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
An O(n log n) 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....
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:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers
