A combinatorial strongly polynomial algorithm for minimizing submodular functions
Journal of the ACM (JACM)
Flows over time with load-dependent transit times
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Minimum cost flows over time without intermediate storage
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
The Quickest Multicommodity Flow Problem
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
An O(n log2 n) algorithm for the optimal sink location problem in dynamic tree networks
Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University
Multicommodity flows over time: Efficient algorithms and complexity
Theoretical Computer Science
Flows in dynamic networks with aggregate arc capacities
Information Processing Letters
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
The Maximum Energy-Constrained Dynamic Flow Problem
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Earliest Arrival Flows with Multiple Sources
Mathematics of Operations Research
An adaptive latency mitigation scheme for massively multiuser virtual environments
Journal of Network and Computer Applications
Traffic Networks and Flows over Time
Algorithmics of Large and Complex Networks
Discrete Applied Mathematics
Equilibria in Dynamic Selfish Routing
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Multicommodity flows over time: efficient algorithms and complexity
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
An FPTAS for flows over time with aggregate arc capacities
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Budget-constrained bulk data transfer via internet and shipping networks
Proceedings of the 8th ACM international conference on Autonomic computing
Universal packet routing with arbitrary bandwidths and transit times
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
An efficient algorithm for evacuation problems in dynamic network flows with uniform arc capacity
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Truck dock assignment problem with operational time constraint within crossdocks
IEA/AIE'06 Proceedings of the 19th international conference on Advances in Applied Artificial Intelligence: industrial, Engineering and Other Applications of Applied Intelligent Systems
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
A Stackelberg strategy for routing flow over time
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Packet routing: complexity and algorithms
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Maximum multicommodity flows over time without intermediate storage
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Approximating earliest arrival flows in arbitrary networks
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Energy-efficient data redistribution in sensor networks
ACM Transactions on Sensor Networks (TOSN)
Earliest arrival flows in networks with multiple sinks
Discrete Applied Mathematics
| Hi-index | 0.00 |
A dynamic network consists of a graph with capacities and transit times on its edges. The quickest transshipment problem is de2ned by a dynamic network with several sources and sinks; each source has a speci2ed supply and each sink has a specified demand. The problem is to send exactly the right amount of 6ow out of each source and into each sink in the minimum overall time.Variations of the quickest transshipment problem have been studied extensively; the special case of the problem with a single sink is commonly used to model building evacuation. Similar dynamic network flow problems have numerous other applications; in some of these, the capacities are small integers and it is important to find integral flows. There are no polynomial-time algorithms known for most of these problems.In this paper we give the first polynomial-time algorithm for the quickest transshipment problem. Our algorithm provides an integral optimum flow. Previously, the quickest transshipment problem could only be solved efficiently in the special case of a single source and single sink.