A linear time algorithm for computing minmax regret 1-median on a tree network
From MaRDI portal
Publication:486974
DOI10.1007/S00453-013-9851-7zbMATH Open1317.05182OpenAlexW2001915330MaRDI QIDQ486974FDOQ486974
Authors: Tsunehiko Kameda, Zhao Song, Binay Bhattacharya 
Publication date: 19 January 2015
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-013-9851-7
Recommendations
- A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree
- Computing minmax regret 1-median on a tree network with positive/negative vertex weights
- An improved algorithm for the minmax regret median problem on a tree
- On the minmax regret path median problem on trees
- Minmax-regret robust 1-median location on a tree
- The Minmax Regret Reverse 1-Median Problem on Trees with Uncertain Vertex Weights
- Improved algorithms for computing minmax regret sinks on dynamic path and tree networks
- The minmax relative regret median problem on networks
- Improved Algorithms for the Minmax Regret 1-Median Problem
- A branch and bound algorithm for the minimax regret spanning arborescence
Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Signed and weighted graphs (05C22)
Cites Work
- Robust discrete optimization and its applications
- Minmax-regret robust 1-median location on a tree
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Minmax Regret Median Location on a Network Under Uncertainty
- An improved algorithm for the minmax regret median problem on a tree
- Computing minmax regret 1-median on a tree network with positive/negative vertex weights
- Improved algorithms for the minmax-regret 1-center and 1-median problems
- Location science research: a review
- An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs
- Efficient algorithms for two generalized 2-median problems and the group median problem on trees
- Robust location problems with pos/neg weights on a tree
- An O\((n\log n)\) version of the Averbakh-Berman algorithm for the robust median of a tree
Cited In (17)
- Improved minmax regret 1-center algorithms for cactus networks with \(c\) cycles
- Efficient algorithms for the minmax regret path center problem with length constraint on trees
- An improved algorithm for the minmax regret path center problem on trees
- Minmax Regret Median Location on a Network Under Uncertainty
- An \(O(n(\log n)^{2}/\log \log n)\) algorithm for the single maximum coverage location or the \((1,X_p)\)-medianoid problem on trees
- The minmax relative regret median problem on networks
- A minmax regret median problem on a tree under uncertain locations of the demand points
- An improved algorithm for the minmax regret median problem on a tree
- A quadratic time exact algorithm for continuous connected 2-facility location problem in trees
- Improved Algorithms for the Minmax Regret 1-Median Problem
- Improved algorithms for computing minmax regret sinks on dynamic path and tree networks
- Computing minmax regret 1-median on a tree network with positive/negative vertex weights
- Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities
- A linear time algorithm for the \(p\)-maxian problem on trees with distance constraint
- An O\((n\log n)\) version of the Averbakh-Berman algorithm for the robust median of a tree
- Robust reverse 1-center problems on trees with interval costs
- A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree
This page was built for publication: A linear time algorithm for computing minmax regret 1-median on a tree network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q486974)
