Programming in Networks and Graphs

Name: Programming in Networks and Graphs
Brand: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
SKU: 9783540189695
Price: 19327 HUF
Availability: InStock

On the Combinatorial Background and Near-Equivalence of Network Flow and Matching Algorithms

Szerző: Ulrich Derigs

Nyelv:

Kötés: Puha kötésű

Kiadó: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG

Elérhetőség: Beszállítói készleten

Küldés 5-8 napon belül

19 327 Ft

Network flow and matching are often treated separately in the literature and for each class a variet...

Információk a könyvről

Szerző

Ulrich Derigs

Nyelv

Angol

Kötés

Könyv - Puha kötésű

oldal

315

EAN

9783540189695

ISBN

3540189696

Enbook ID

02172552

Kiadó

Springer-Verlag Berlin and Heidelberg GmbH & Co. KG

Súly

545

Méretek

152 x 229 x 19

Teljes leírás

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.

Érdekelheti

Azok a vásárlók, akik ezt a könyvet megvásárolták, a következőket is megvásárolták

Leggyakrabban keresett

Categories

Authors

Publishers

Termékek

Termékek

Leggyakrabban keresett

Categories

Authors

Publishers

Termékek

Termékek

Programming in Networks and Graphs

On the Combinatorial Background and Near-Equivalence of Network Flow and Matching Algorithms

Információk a könyvről

Teljes leírás

Érdekelheti

Azok a vásárlók, akik ezt a könyvet megvásárolták, a következőket is megvásárolták