Sink Evacuation on Trees with Dynamic Confluent Flows
From MaRDI portal
Publication:4636507
DOI10.4230/LIPIcs.ISAAC.2016.25zbMath1398.05098arXiv1607.08041OpenAlexW2576544240MaRDI QIDQ4636507
Publication date: 19 April 2018
Full work available at URL: https://arxiv.org/abs/1607.08041
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Extremal problems in graph theory (05C35) Deterministic network models in operations research (90B10) Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22) Flows in graphs (05C21)
Related Items (7)
Minmax regret for sink location on dynamic flow paths with general capacities ⋮ Minmax centered \(k\)-partitioning of trees and applications to sink evacuation with dynamic confluent flows ⋮ Capacity provisioning for evacuation on path networks ⋮ Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights ⋮ Minsum \(k\)-sink problem on path networks ⋮ Almost linear time algorithms for minsum \(k\)-sink problems on dynamic flow path networks ⋮ Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities
This page was built for publication: Sink Evacuation on Trees with Dynamic Confluent Flows
