×


 x 

Shopping cart
Ulrich Derigs - Programming in Networks and Graphs - 9783540189695 - V9783540189695
Stock image for illustration purposes only - book cover, edition or condition may vary.

Programming in Networks and Graphs

€ 63.10
FREE Delivery in Ireland
Description for Programming in Networks and Graphs Paperback. Series: Lecture Notes in Economics and Mathematical Systems. Num Pages: 326 pages, biography. BIC Classification: KCA; KJT. Category: (P) Professional & Vocational. Dimension: 229 x 152 x 18. Weight in Grams: 545.
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 ... Read more

Product Details

Format
Paperback
Publication date
1988
Publisher
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Germany
Number of pages
326
Condition
New
Series
Lecture Notes in Economics and Mathematical Systems
Number of Pages
315
Place of Publication
Berlin, Germany
ISBN
9783540189695
SKU
V9783540189695
Shipping Time
Usually ships in 15 to 20 working days
Ref
99-15

Reviews for Programming in Networks and Graphs

Goodreads reviews for Programming in Networks and Graphs


Subscribe to our newsletter

News on special offers, signed editions & more!