Order Total (1 Item Items):
Shipping Destination:
Programming Networks Graphs Combinatorial by Derigs Ulrich (12 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (12)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (7)
- As New, Fine or Near Fine (4)
- Very Good or Good (1)
- Fair or Poor (No further results match this refinement)
- As Described (No further results match this refinement)
Binding
- All Bindings
- Hardcover (No further results match this refinement)
- Softcover (12)
Collectible Attributes
- First Edition (No further results match this refinement)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (7)
- Not Print on Demand (12)
Language (1)
Free Shipping
- Free Shipping to U.S.A. (No further results match this refinement)
Seller Location
Seller Rating
-
Programming in networks and graphs : on the combinatorial background and near equivalence of network flow and matching algorithms. Lecture Notes in Economics and Mathematical Systems, Vol. 300;
Language: English
Published by Berlin ; Heidelberg ; New York ; London ; Paris ; Tokyo : Springer, 1988
ISBN 10: 3540189696 ISBN 13: 9783540189695
Seller: books4less (Versandantiquariat Petra Gros GmbH & Co. KG), Welling, Germany
Seller rating 5 out of 5 stars
Broschiert; Condition: Gut. XI, 315 Seiten; Das Buch befindet sich in einem ordentlich erhaltenen Zustand. In ENGLISCHER Sprache. Sprache: Englisch Gewicht in Gramm: 540.
-
Programming in Networks and Graphs: On the Combinatorial Background and Near-equivalence of Network Flow and Matching Algorithms
Language: English
Published by Springer-Verlag Berlin and Heidelberg GmbH & Co. K, 1988
ISBN 10: 3540189696 ISBN 13: 9783540189695
Softcover. Condition: Très bon. 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.
-
-
-
-
Programming in Networks and Graphs : On the Combinatorial Background and Near-equivalence of Network Flow and Matching Algorithms
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: New.
-
Paperback. Condition: Brand New. 1st edition. 328 pages. 9.00x5.90x0.74 inches. In Stock.
-
Programming in Networks and Graphs : On the Combinatorial Background and Near-Equivalence of Network Flow and Matching Algorithms
Language: English
Published by Springer Berlin Heidelberg, 1988
ISBN 10: 3540189696 ISBN 13: 9783540189695
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.
-
Taschenbuch. Condition: Neu. Programming in Networks and Graphs | On the Combinatorial Background and Near-Equivalence of Network Flow and Matching Algorithms | Ulrich Derigs | Taschenbuch | xi | Englisch | 1988 | Springer | EAN 9783540189695 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
-
Programming in Networks and Graphs : On the Combinatorial Background and Near-equivalence of Network Flow and Matching Algorithms
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: As New. Unread book in perfect condition.
-
Paperback. Condition: Like New. Like New. book.
-
Condition: As New. Unread book in perfect condition.
