An O(nlogn) version of the Averbakh-Berman algorithm for the robust median of a tree

Authors:
Gerth StøLting Brodal;Loukas Georgiadis;Irit Katriel
Affiliations:
BRICS, University of Aarhus, írhus, Denmark;HP Labs, Palo Alto, CA, USA;Computer Science Department, Brown University, 115 Waterman st., Providence, RI 02912, USA
Venue:
Operations Research Letters
Year:
2008

Citing 4
Cited 2

Efficiency of a Good But Not Linear Set Union Algorithm

Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Minmax Regret Median Location on a Network Under Uncertainty

INFORMS Journal on Computing
Improved algorithms for the minmax regret 1-median problem

COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics

Improved algorithms for the minmax-regret 1-center and 1-median problems

ACM Transactions on Algorithms (TALG)
Minimax Regret Single-Facility Ordered Median Location Problems on Networks

INFORMS Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that the minmax regret median of a tree can be found in O(nlogn) time. This is obtained by a modification of Averbakh and Berman's O(nlog^2n)-time algorithm: we design a dynamic solution to their bottleneck subproblem of finding the middle of every root-leaf path in a tree.