Abstract
In this paper, we consider the minimax regret 1-sink location problem in a dynamic cycle network with positive edge lengths and uniform edge capacity. Let C be an undirected cycle graph of n vertices and n edges. Each edge has a positive edge length and a uniform edge capacity. Each vertex has a weight which is not known exactly but we know the interval it belongs to. The problem is to find a point x as the sink on the cycle and all weights evacuate to x such that the maximum regret for all possible weight distributions is minimized. This paper presents an O(n3logn) time algorithm.
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.
