An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths
type: Item
instance of: scholarly article
title: An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths
zbMATH Open document ID: 1228.90018
author: Naoyuki Kamiyama
author: Naoki Katoh
author: Atsushi Takizawa
published in: Discrete Applied Mathematics
publication date: 2010-04-28T00:00:00Z
full work available at URL: http://hdl.handle.net/2433/123378
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 5702680
zbMATH Keywords: dynamic network
zbMATH Keywords: evacuation problem
zbMATH Keywords: uniform path-length
MaRDI profile type: Publication
OpenAlex ID: W2029812534
cites work: Q2776597
cites work: Q5514188
cites work: Q3084809
cites work: The quickest transshipment problem
cites work: Quickest Flows Over Time
cites work: An \(O(n \log^2 n)\) algorithm for the optimal sink location problem in dynamic tree networks
cites work: Multicommodity flows over time: Efficient algorithms and complexity
cites work: Efficient continuous-time dynamic network flow algorithms
cites work: Q4286721
cites work: A Fast Parametric Maximum Flow Algorithm and Applications
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: Parametric flows, weighted means of cuts, and fractional combinatorial optimization
cites work: A new approach to the maximum-flow problem
cites work: Q4871750
cites work: Q3579487
DOI: 10.1016/J.DAM.2009.04.007
description: scientific article; zbMATH DE number 5702680