Computing minmax regret 1-median on a tree network with positive/negative vertex weights

DOI10.1007/978-3-642-35261-4_61zbMATH Open1260.90115OpenAlexW2274566957MaRDI QIDQ4909575FDOQ4909575

Authors: Binay Bhattacharya, Tsunehiko Kameda, Zhao Song 

Publication date: 21 March 2013

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-35261-4_61

Recommendations

• A linear time algorithm for computing minmax regret 1-median on a tree network
• A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree
• On the minmax regret path median problem on trees
• Improved Algorithms for the Minmax Regret 1-Median Problem
• An improved algorithm for the minmax regret median problem on a tree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Nonnumerical algorithms (68W05) Discrete location and assignment (90B80)

Cited In (9)

• Improved minmax regret 1-center algorithms for cactus networks with \(c\) cycles
• Robust location problems with pos/neg weights on a tree
• Minmax regret 1-facility location on uncertain path networks
• Efficient computation of 2-medians in a tree network with positive/negative weights
• A linear time algorithm for computing minmax regret 1-median on a tree network
• Robust vertex centdian facility location problem on tree networks
• Improved complexity results for the robust mean absolute deviation problem on networks with linear vertex weights
• A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree
• The \(p\)-center problem under locational uncertainty of demand points

This page was built for publication: Computing minmax regret 1-median on a tree network with positive/negative vertex weights

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