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
| Artikelnummer | 9200000107772219 |
|---|---|
| EAN | 9781316636831 |
| Categorie | Educational Books |
| Productgroep | Boeken |
| Segment | Textual/Printed/Reference Materials |
| Prijs Nederland | € 41,99 |
| Prijs België | € 41,99 |
| Verzendkosten NL | Gratis |
| Verzendkosten BE | Gratis |
| Levertijd Nederland | Over 15 dagen |
| Levertijd België | Over 16 dagen |
| Verkoper | Partner |
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.