An Efficient Algorithm for Evacuation Problems in Dynamic Network Flows with Uniform Arc Capacity (Algorithmic aspects in information and management)

Algorithmic aspects in information and management : Second International Conference, AAIM 2006, Hong Kong, China, June 20-22, 2006 : proceedings : (Lecture notes in computer science ; 4041)The 2nd Int. Conf. on Algorithmic Aspect in Information and Management. LNCS4041In this paper, we consider the quickest flow problem in a network which consists of a directed graph with capacities and transit times on its arcs. We present an O(n logn) time algorithm for the quickest flow problem in a network of grid structure with uniform arc capacity which has a single sink where n is the number of vertices in the network

An efficient algorithm for evacuation problem in dynamic network flows with uniform arc capacity

Algorithmic aspects in information and management : Second International Conference, AAIM 2006, Hong Kong, China, June 20-22, 2006 : proceedings : (Lecture notes in computer science ; 4041)The 2nd Int. Conf. on Algorithmic Aspect in Information and Management. LNCS4041In this paper, we consider the quickest flow problem in a network which consists of a directed graph with capacities and transit times on its arcs. We present an O(n logn) time algorithm for the quickest flow problem in a network of grid structure with uniform arc capacity which has a single sink where n is the number of vertices in the network