Extended maximum concurrent flow problem with saturated capacity
From MaRDI portal
Abstract: The present work studies a kind of Maximum Concurrent Flow Problem, called as Extended Maximum Concurrent Flow Problem with Saturated Capacity. Our major contributions are as follows: (A) Propose the definition of Extensive Maximum Concurrent Flow Problem with Saturated Capacity and prove its solutions exist. (B) Design a approximation algorithm to solve the problem. (C) Propose and prove the complexity and the approximation measures of the algorithm we design.
This page was built for publication: Extended maximum concurrent flow problem with saturated capacity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6226259)
