Programming in Networks and Graphs / Najlacnejšie knihy
Programming in Networks and Graphs

Code: 02172552

Programming in Networks and Graphs

by Ulrich Derigs

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 questi ... more

51.49 €

RRP: 55.75 €

You save 4.26 €


In stock at our supplier
Shipping in 5 - 8 days
Add to wishlist

You might also like

Give this book as a present today
  1. Order book and choose Gift Order.
  2. We will send you book gift voucher at once. You can give it out to anyone.
  3. Book will be send to donee, nothing more to care about.

Book gift voucher sampleRead more

More about Programming in Networks and Graphs

You get 125 loyalty points

Book 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.

Book details

Book category Books in English Economics, finance, business & management Economics Economic theory & philosophy

51.49 €

Trending among others

All about us



Shopping guide
Digest
Books by language
Payment
Delivery 2.99 €

Collection points Bratislava a 12772 dalších

Slovensko
България Hrvatska România Magyarország Polska Česko

Copyright ©2008-26 najlacnejsie-knihy.sk All rights reservedPrivacyCookies

Account: Log in
Všetky knihy sveta na jednom mieste. Navyše za skvelé ceny.

Shopping cart ( Empty )

For free shipping
shop for 59,99 € and more

You are here: