Improved Algorithms for the Minmax Regret 1-Median Problem

DOI10.1007/11809678_8zbMath1162.05364OpenAlexW2584878027MaRDI QIDQ3591312

Hung-I Yu, Biing-Feng Wang, Tzu-Chin Lin

Publication date: 10 September 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11809678_8

zbMATH Keywords

mediansminmax regret optimizationLocation theory

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete location and assignment (90B80) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

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

This page was built for publication: Improved Algorithms for the Minmax Regret 1-Median Problem