Omschrijving

Network flow theory has been used across a number of disciplines, including theoretical computer science, operations research, and discrete math, to model not only problems in the transportation of goods and information, but also a wide range of applications from image segmentation problems in computer vision to deciding when a baseball team has been eliminated from contention. This graduate text and reference presents a succinct, unified view of a wide variety of efficient combinatorial algorithms for network flow problems, including many results not found in other books. It covers maximum flows, minimum-cost flows, generalized flows, multicommodity flows, and global minimum cuts and also presents recent work on computing electrical flows along with recent applications of these flows to c

Kenmerken

Artikelnummer9200000107772219
EAN9781316636831
CategorieEducational Books
ProductgroepBoeken
SegmentTextual/Printed/Reference Materials
Prijs Nederland€ 41,99
Prijs België€ 41,99
Verzendkosten NLGratis
Verzendkosten BEGratis
Levertijd NederlandOver 15 dagen
Levertijd BelgiëOver 16 dagen
VerkoperPartner

Network Flow Algorithms bestellen bij snelkeus

Koop Network Flow Algorithms van Onbekend online in de categorie Educational Books. Prijs € 41,99, levering in België · Over 15 dagen.