Programming in Networks and Graphs: On the Combinatorial Background and Near-equivalence of Network Flow and Matching Algorithms

Ulrich Derigs

ISBN 10: 3540189696 / ISBN 13: 9783540189695

Edité par Springer-Verlag Berlin and Heidelberg GmbH & Co. K, 1988

A propos de cet article

Légères traces d'usure sur la couverture. Salissures sur la tranche. Couverture différente. Edition 1988. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Slight signs of wear on the cover. Stains on the edge. Different cover. Edition 1988. Ammareal gives back up to 15% of this item's net price to charity organizations.

N° de réf. du vendeur E-591-001

Détails bibliographiques

• Titre: Programming in Networks and Graphs: On the Combinatorial Background and Near-equivalence of Network Flow and Matching Algorithms
• Éditeur: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
• Date de parution: 1988
• Langue: anglais
• ISBN à 10 chiffres: 3540189696
• ISBN à 13 chiffres: 9783540189695
• Reliure: Softcover
• État de l'article: Très bon

A propos de ce titre

Synopsis

Network flow and matching are often treated separately in the literature and for each class a variety of different algorithms has been developed. These algorithms are usually classified as primal, dual, primal-dual etc. The question the author addresses in this work is that of the existence of a common combinatorial principle which might be inherent in all those apparently different approaches. It is shown that all common network flow and matching algorithms implicitly follow the so-called shortest augmenting path. This can be interpreted as a greedy-like decision rule where the optimal solution is built up through a sequence of local optimal solutions. The efficiency of this approach is realized by combining this myopic decision rule with an anticipant organization. The approach of this work is organized as follows. For several standard flow and matching problems the common solution procedures are first reviewed. It is then shown that they all reduce to a common basic principle, that is, they all perform the same computational steps if certain conditions are set properly and ties are broken according to a common rule. Recognizing this near-equivalence of all commonly used algorithms the question of the best method has to be modified - all methods are (only) different implementations of the same algorithm obtained by different views of the problem.