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

Gerth StøLting Brodal,Loukas Georgiadis,Irit Katriel

Operations Research Letters（2008）

引用 23|浏览0

暂无评分

摘要

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.

查看译文

关键词

minmax regret,robust optimization,tree median,robust median,robust optimization.,minmax regret median,time algorithm,bottleneck subproblem,dynamic solution,root-leaf path,averbakh-berman algorithm

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要