Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights
From MaRDI portal
Publication:2232232
DOI10.1007/978-3-030-68211-8_5OpenAlexW3134604564MaRDI QIDQ2232232
Yuya Higashikawa, Junichi Teruyama, Tetsuya Fujie, Yuki Tokuni, Naoki Katoh
Publication date: 4 October 2021
Full work available at URL: https://arxiv.org/abs/2011.13569
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Minimax regret 1-sink location problem with accessibility in dynamic general networks
- Finding the upper envelope of n line segments in O(n log n) time
- Nearest common ancestors: a survey and a new algorithm for a distributed environment
- Minimax regret 1-median problem in dynamic path networks
- An \(O(n \log^2 n)\) algorithm for the optimal sink location problem in dynamic tree networks
- Improved algorithms for computing minmax regret sinks on dynamic path and tree networks
- Multiple sink location problems in dynamic path networks
- Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences
- Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
- Robust discrete optimization and its applications
- Minsum \(k\)-sink problem on dynamic flow path networks
- Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights
- Minsum \(k\)-sink problem on 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
- Improved algorithms for computing \(k\)-sink on dynamic flow path networks
- The Quickest Transshipment Problem
- Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity
- An Introduction to Network Flows over Time
- Sink Evacuation on Trees with Dynamic Confluent Flows
- Constructing Maximal Dynamic Flows from Static Flows
- Minimax regret vertex 2-sink location problem in dynamic path networks
