Zum Hauptinhalt springen
Dekorationsartikel gehören nicht zum Leistungsumfang.
Network Flow Algorithms
Taschenbuch von David P. Williamson
Sprache: Englisch

56,70 €*

inkl. MwSt.

Versandkostenfrei per Post / DHL

Lieferzeit 1-2 Wochen

Kategorien:
Beschreibung
Offers an up-to-date, unified treatment of combinatorial algorithms to solve network flow problems for graduate students and professionals.
Offers an up-to-date, unified treatment of combinatorial algorithms to solve network flow problems for graduate students and professionals.
Über den Autor
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.
Inhaltsverzeichnis
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.
Details
Erscheinungsjahr: 2019
Fachbereich: EDV
Genre: Importe, Informatik
Rubrik: Naturwissenschaften & Technik
Thema: Lexika
Medium: Taschenbuch
ISBN-13: 9781316636831
ISBN-10: 1316636836
Sprache: Englisch
Einband: Kartoniert / Broschiert
Autor: Williamson, David P.
Hersteller: Cambridge University Press
Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, D-36244 Bad Hersfeld, gpsr@libri.de
Maße: 229 x 152 x 19 mm
Von/Mit: David P. Williamson
Erscheinungsdatum: 30.09.2019
Gewicht: 0,534 kg
Artikel-ID: 123792965
Über den Autor
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.
Inhaltsverzeichnis
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.
Details
Erscheinungsjahr: 2019
Fachbereich: EDV
Genre: Importe, Informatik
Rubrik: Naturwissenschaften & Technik
Thema: Lexika
Medium: Taschenbuch
ISBN-13: 9781316636831
ISBN-10: 1316636836
Sprache: Englisch
Einband: Kartoniert / Broschiert
Autor: Williamson, David P.
Hersteller: Cambridge University Press
Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, D-36244 Bad Hersfeld, gpsr@libri.de
Maße: 229 x 152 x 19 mm
Von/Mit: David P. Williamson
Erscheinungsdatum: 30.09.2019
Gewicht: 0,534 kg
Artikel-ID: 123792965
Sicherheitshinweis

Ähnliche Produkte

Ähnliche Produkte