Improved Algorithms for the Minmax Regret 1-Median Problem
From MaRDI portal
Recommendations
- Improved Algorithms for the Minmax-Regret 1-Center Problem
- Improved algorithms for the minmax-regret 1-center and 1-median problems
- An improved algorithm for the minmax regret median problem on a tree
- A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree
- A linear time algorithm for computing minmax regret 1-median on a tree network
Cited in
(12)- An improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion
- On the minmax regret path median problem on trees
- The minmax relative regret median problem on networks
- A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree
- Efficient Algorithms for k-Regret Minimizing Sets
- An improved algorithm for the minmax regret median problem on a tree
- A linear time algorithm for computing minmax regret 1-median on a tree network
- 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
- Improved Algorithms for the Minmax-Regret 1-Center Problem
- The Minmax Regret Reverse 1-Median Problem on Trees with Uncertain Vertex Weights
- An O\((n\log n)\) version of the Averbakh-Berman algorithm for the robust median of a tree
This page was built for publication: Improved Algorithms for the Minmax Regret 1-Median Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3591312)