An O\((n\log n)\) version of the Averbakh-Berman algorithm for the robust median of a tree
type: Item
instance of: scholarly article
title: An O\((n\log n)\) version of the Averbakh-Berman algorithm for the robust median of a tree
zbMATH Open document ID: 1165.90656
author: Gerth Stølting Brodal
author: Loukas Georgiadis
author: Irit Katriel
published in: Operations Research Letters
publication date: 2008-05-29T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 5280648
zbMATH Keywords: minmax regret
zbMATH Keywords: tree median
zbMATH Keywords: robust optimization
MaRDI profile type: Publication
full work available at URL: j.orl.2007.02.012
OpenAlex ID: W2005183677
cites work: On the computational power of pushdown automata
cites work: Minmax Regret Median Location on a Network Under Uncertainty
cites work: An improved algorithm for the minmax regret median problem on a tree
cites work: Minmax-regret robust 1-median location on a tree
cites work: A linear-time algorithm for a special case of disjoint set union
cites work: An Algorithmic Approach to Network Location Problems. II: Thep-Medians
cites work: Efficiency of a Good But Not Linear Set Union Algorithm
cites work: Improved Algorithms for the Minmax Regret 1-Median Problem
DOI: 10.1016/J.ORL.2007.02.012
description: scientific article; zbMATH DE number 5280648