scientific article; zbMATH DE number 7561368
From MaRDI portal
Publication:5091004
DOI10.4230/LIPIcs.ISAAC.2018.14MaRDI QIDQ5091004
Yuya Higashikawa, Binay K. Bhattacharya, Naoki Katoh, Tsunehiko Kameda
Publication date: 21 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Minsum \(k\)-sink problem on path networks, Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities
Cites Work
- Unnamed Item
- Finding the upper envelope of n line segments in O(n log n) time
- Minimax regret 1-median problem in dynamic path networks
- Improved algorithms for computing minmax regret sinks on dynamic path and tree networks
- Multiple sink location problems in dynamic path networks
- Minsum \(k\)-sink problem on dynamic flow 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
- Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity
- Minimax Regret 1-Sink Location Problems in Dynamic Path Networks
- Constructing Maximal Dynamic Flows from Static Flows
