Abstract
In this paper, we consider a sink location in a dynamic network which consists of a graph with capacities and transit times on its arcs. Given a dynamic network with initial supplies at vertices, the problem is to find a vertex υ as a sink in the network such that we can send all the initial supplies to υ as quickly as possible. We present an O(n log 2 n) time algorithm for the sink location problem in a dynamic network of tree structure, where n is the number of vertices in the network. This improves upon the existing O(n 2)-time bound. As a corollary, we also show that the quickest transshipment problem can be solved in O(n log 2 n) time if a given network is a tree and has a single sink. Our results are based on data structures for representing tables (i.e., set of intervals with their height), which may be of independent interest.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
