Network flow algorithms

by Williamson, David P.

Type Book

Rate 0.0 /5

Details

Files

Reviews

Download

Title Statements

Full title :Network flow algorithms / David P. Williamson.

Summary

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 classical problems in network flow theory

Edition Statements

Publication Date:© 2019

Publication Statements

Publisher(s):Cambridge University Press
Place of Publication:Cambridge, United Kingdom
Language:eng
Publication Date:© 2019

The Physical Object

Description:xii, 314 p. : : ill.

Edition Identifiers

ISBN:1107185890, 1316636836, 9781107185890, 9781316636831
oclc:on1134663941
LC Classification:T57.85
Dewey Decimal:003

1. Preliminaries: shortest path algorithms ; 2. Maximum flow algorithms ; 3. Global minimum cut algorithms ; 4. More maximum flow algorithms ; 5. Minimum-cost circulation algorithms ; 6. Generalized flow algorithms ; 7. Multicommodity flow algorithms ; 8. Electrical flow algorithms ; 9. Open questions

Subjects

Algorithmes ALGORITHMS Analyse de réseau (planification) Analyse de réseau (planification) -- Lo… Computer algorithms Network analysis (Planning) -- Computer… Réseaux d'ordinateurs System theory Systèmes, Théorie des Théorie des systèmes