A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree

DOI10.1007/978-3-642-32241-9_1zbMath1365.05274OpenAlexW49447563MaRDI QIDQ2914306

Tsunehiko Kameda, Binay K. Bhattacharya

Publication date: 25 September 2012

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

Full work available at URL: https://doi.org/10.1007/978-3-642-32241-9_1

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22)

Related Items

Minmax regret for sink location on dynamic flow paths with general capacities ⋮ Minmax regret 1-facility location on uncertain path networks ⋮ The \(p\)-center problem under locational uncertainty of demand points ⋮ A minmax regret median problem on a tree under uncertain locations of the demand points ⋮ A linear time algorithm for computing minmax regret 1-median on a tree network ⋮ Minimax regret 1-median problem in dynamic path networks ⋮ Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities ⋮ Minimax regret 1-sink location problem in dynamic path networks