Balanced network flows. II. Simple augmentation algorithms
نویسندگان
چکیده
In previous papers, we discussed the fundamental theory of matching problems and algorithms in terms of a network flow model. In this paper, we present explicit augmentation procedures which apply to the wide range of capacitated matching problems and which are highly efficient for k-factor problems and the f-factor problem. ! 1999 John Wiley & Sons, Inc. Networks 33: 29–41, 1999
منابع مشابه
Balanced network flows. V. Cycle-canceling algorithms
The present paper continues our study of balanced network flows and general matching problems [6–9]. Beside the techniques presented in these papers, there is a further strategy to obtain maximum balanced flows. This approach is due to Anstee [2] and results in state-of-theart algorithms for capacitated matching problems. In contrast to the balanced augmentation algorithm and the scaling method...
متن کاملBalanced network flows. III. Strongly polynomial augmentation algorithms
We discuss efficient augmentation algorithms for the maximum balanced flow problem which run in O (nm ) time. More explicitly, we discuss a balanced network search procedure which finds valid augmenting paths of minimum length in linear time. The algorithms are based on the famous cardinality matching algorithm given by Micali and Vazirani. A comprehensive description of the double depth first ...
متن کاملBalanced Network Flows
Let G be a simple, undirected graph. A special network N, called a balanced network, is constructed from G such that maximum matchings and f-factors in G correspond to maximum flows in N. A max-balancedflow-min-balanced-cut theorem is proved for balanced networks. It is shown that Tutte’s Factor Theorem is equivalent to this network flow theorem, and that f-barriers are equivalent to minimum ba...
متن کاملBalancing Applied to Maximum Network Flow
We explore balancing as a definitional and algorithmic tool for finding minimum cuts and maximum flows in ordinary and parametric networks. We show that a standard monotonic parametric maximum flow problem can be formulated as a problem of computing a particular maximum flow that is balanced in an appropriate sense. We present a divide-and-conquer algorithm to compute such a balanced flow in a ...
متن کاملBalanced network flows. I. A unifying framework for design and analysis of matching algorithms
We discuss a wide range of matching problems in terms of a network flow model. More than this, we start up a matching theory which is very intuitive and independent from the original graph context. This first paper contains a standardized theory for the performance analysis of augmentation algorithms in a wide area of matching problems. Several optimality criteria are given which do not use cut...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Networks
دوره 33 شماره
صفحات -
تاریخ انتشار 1999