Improved Algorithms for the Minmax-Regret 1-Center Problem
From MaRDI portal
Publication:5459148
DOI10.1007/11940128_54zbMath1135.90360OpenAlexW1570112134MaRDI QIDQ5459148
Hung-I Yu, Biing-Feng Wang, Tzu-Chin Lin
Publication date: 24 April 2008
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11940128_54
Discrete location and assignment (90B80) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (2)
New approaches to the robust 1-center location problems on tree networks ⋮ The backup 2‐center and backup 2‐median problems on trees
This page was built for publication: Improved Algorithms for the Minmax-Regret 1-Center Problem