An O(n^2² n) time algorithm for minmax regret minsum sink on path networks
From MaRDI portal
Publication:5091004
Recommendations
- Improved Algorithms for Computing Minmax Regret 1-Sink and 2-Sink on Path Network
- Improved algorithms for computing minmax regret sinks on dynamic path and tree networks
- Minmax-regret evacuation planning for cycle networks
- Minmax regret for sink location on dynamic flow paths with general capacities
- Minsum \(k\)-sink problem on dynamic flow path networks
Cites work
- scientific article; zbMATH DE number 1714716 (Why is no real title available?)
- Constructing maximal dynamic flows from static flows
- Finding the upper envelope of n line segments in O(n log n) time
- Improved algorithms for computing minmax regret sinks on dynamic path and tree networks
- Minimax regret 1-sink location problem in dynamic path networks
- Minimax regret 1-sink location problems in dynamic path networks
- Minimax regret sink location problem in dynamic tree networks with uniform capacity
- Minmax regret k-sink location on a dynamic path network with uniform capacities
- Minsum \(k\)-sink problem on dynamic flow path networks
- Multiple sink location problems in dynamic path networks
Cited in
(5)- Improved Algorithms for Computing Minmax Regret 1-Sink and 2-Sink on Path Network
- Minsum \(k\)-sink problem on path networks
- Improved algorithms for computing minmax regret sinks on dynamic path and tree networks
- Minmax regret k-sink location on a dynamic path network with uniform capacities
- Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights
This page was built for publication: An \(O(n^2\log^2 n)\) time algorithm for minmax regret minsum sink on path networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5091004)
