An O(n^2² n) time algorithm for minmax regret minsum sink on path networks
From MaRDI portal
Publication:5091004
DOI10.4230/LIPICS.ISAAC.2018.14MaRDI QIDQ5091004FDOQ5091004
Authors: Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh 
Publication date: 21 July 2022
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
- Minimax regret 1-sink location problems in dynamic path networks
- Constructing maximal dynamic flows from static flows
- Title not available (Why is that?)
- Finding the upper envelope of n line segments in O(n log n) time
- Minimax regret 1-sink location problem in dynamic 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
- Minimax regret sink location problem in dynamic tree networks with uniform capacity
- Multiple sink location problems in dynamic path networks
- Minsum \(k\)-sink problem on dynamic flow 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)
