Improved Algorithms for the Minmax-Regret 1-Center Problem

DOI10.1007/11940128_54MaRDI QIDQ5459148zbMATH OpenOpenAlexFDO

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

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

zbMATH Keywords

centerslocation theoryminmax-regret optimization

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Distance in graphs (05C12) Discrete location and assignment (90B80)

Recommendations

• Improved algorithms for the minmax-regret 1-center and 1-median problems
• Improved Algorithms for the Minmax Regret 1-Median Problem
• An improved algorithm for the minmax regret path center problem on trees
• On the minmax regret path center problem on trees
• An improved algorithm for the minmax regret median problem on a tree

Cited in

(10)

• Improved minmax regret 1-center algorithms for cactus networks with c cycles
• The backup 2‐center and backup 2‐median problems on trees
• An improved algorithm for the minmax regret path center problem on trees
• Improved algorithms for the minmax-regret 1-center and 1-median problems
• Improved Algorithms for the Minmax Regret 1-Median Problem
• New approaches to the robust 1-center location problems on tree networks
• Algorithms for the robust 1-center problem on a tree
• Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks
• On the minmax regret path center problem on trees
• An improved algorithm for the minmax regret path centdian problem on trees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5459148)