Network Flow Algorithms

ISBN-13: 9781107185890 / Angielski / Twarda / 2019 / 326 str.

David P. Williamson

Opis

Offers an up-to-date, unified treatment of combinatorial algorithms to solve network flow problems for graduate students and professionals.

Recenzje

'The book includes many lemmas and theorems with proofs. It provides a succinct, amalgamated view of a broad mixture of effective combinatorial algorithms for network flow problems, including many topics not found in other textbooks … I strongly recommend the book for students and researchers.' S. V. Nagaraj, SIGACT News

Spis treści

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.