Balanced network flows. V. Cycle-canceling algorithms

Balanced network flows. V. Cycle-canceling algorithms

0.00 Avg rating0 Votes
Article ID: iaor20023717
Country: United States
Volume: 37
Issue: 4
Start Page Number: 202
End Page Number: 209
Publication Date: Jun 2001
Journal: Networks
Authors: ,
Abstract:

We discuss Anstee's approach for solving generalized matching problems by solving an ordinary flow problem on a balanced network first. We give a description of the algorithm which applies not only to matching problems, but also to the general setting.

Reviews

Required fields are marked *. Your email address will not be published.