Sink location problems in dynamic flow grid networks

DOI10.1007/978-3-031-49190-0_11MaRDI QIDQ6591466zbMATH OpenFDO

Authors Yuya Higashikawa, Ayano Nishii, Junichi Teruyama, Yuki Tokuni

Publication date 22 August 2024

Full work available at URL https://doi.org/10.1007/978-3-031-49190-0_11

zbMATH Keywords

dynamic flowevacuation problemfacility location problempolynomial-time algorithmquickest transshipment problem

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites work

• A faster algorithm for quickest transshipments via an extended discrete Newton method
• An \(O(n \log^2 n)\) algorithm for the optimal sink location problem in dynamic tree networks
• Constructing maximal dynamic flows from static flows
• Discrete Newton methods for the evacuation problem
• Efficient continuous-time dynamic network flow algorithms
• Finding the upper envelope of n line segments in O(n log n) time
• Improved algorithms for computing \(k\)-sink on dynamic flow path networks
• Locating evacuation centers optimally in path and cycle networks
• Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity
• Multiple sink location problems in dynamic path networks
• Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
• Sink Evacuation on Trees with Dynamic Confluent Flows
• The quickest transshipment problem

Cited in

(1)

• Sink location problems in dynamic flow grid networks

This page was built for publication: Sink location problems in dynamic flow grid networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6591466)