Abstract
AbstractGiven an undirected edge‐weighted network in which one edge capacity is allowed to vary, we propose in this paper a polynomial algorithm that needs only two 2‐cut‐trees computations to provide the all pairs maximum 2‐route flow values. Moreover, we provide an extension to the case where k edge capacities may vary, and show that 2k 2‐cut‐trees computations are necessary in order to determine the all pairs maximum 2‐route‐flow values. This makes our algorithm polynomial whenever .
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Transactions in Operational Research
Disclaimer: 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.