David P. Williamson

Network Flow Algorithms

• Broschiertes Buch

Produktbeschreibung

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

---

Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.

Produktdetails

• Verlag: Cambridge University Press
• Seitenzahl: 328
• Erscheinungstermin: 30. September 2019
• Englisch
• Abmessung: 229mm x 152mm x 19mm
• Gewicht: 534g
• ISBN-13: 9781316636831
• ISBN-10: 1316636836
• Artikelnr.: 56017012

Autorenporträt

David P. Williamson is a Professor at Cornell University, New York, in the School of Operations Research and Information Engineering. He has won several awards for his work in discrete optimization, including the 2000 Fulkerson Prize, sponsored by the American Mathematical Society and the Mathematical Programming Society. His previous book, The Design of Approximation Algorithms (Cambridge, 2011), co-authored with David B. Shmoys, won the 2013 INFORMS Lanchester Prize. He has served on several editor boards, and was editor-in-chief of the SIAM Journal on Discrete Mathematics. He is a Fellow of the ACM and of SIAM.

Inhaltsangabe

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.