Network Flow Algorithms
1127 Kč
Sleva až 70% u třetiny knih
This comprehensive text and reference for graduate students and professionals in theoretical computer science, operations research, and discrete math offers an up-to-date, unified view of efficient combinatorial algorithms for a wide variety of network flow problems, including recent work on computing electrical flows and their applications.
Autor: | Williamson, David |
Nakladatel: | Cambridge University Press |
ISBN: | 9781316636831 |
Rok vydání: | 2019 |
Jazyk : | Angličtina |
Vazba: | Paperback / softback |
Počet stran: | 326 |
Mohlo by se vám také líbit..
-
Access to History: The Cold War 1941-95
Williamson, David
-
Mining of Massive Datasets
Leskovec, Jure (Stanford University, California); Rajaraman, Anand; Ullman, Jeffrey David (Stanford University, Californ
-
Mathematics for Machine Learning
Deisenroth, Marc Peter (University College London); Faisal, A. Aldo (Imperial College London); Ong, Cheng Soon
-
Quantum Computing for Computer Scien...
Yanofsky, Noson S.
-
Machine Learning for Asset Managers
De Prado, Lopez
-
Learning Scientific Programming with ...
Hill, Christian
-
The Discrete Mathematical Charms of P...
Applegate, David L.; Bixby, Robert E.; Chvatal, Vasek; Cook, William J.
-
Language, Cognition, and Computation...
-
Hey Cyba
Young, Steve (University of Cambridge)
-
Foundations of Cryptography: Volume ...
Goldreich, Oded
-
Machine Learning Refined
Watt, Jeremy (Northwestern University, Illinois); Borhani, Reza (Northwestern University, Illinois); Katsaggelos, Aggelo
-
Game Theory Basics
Von Stengel, Rudiger
-
How to Write Good Programs
Stevens, Perdita
-
Think Before You Compute
Hinch, E. J. (University of Cambridge)
-
Modern Compiler Implementation in Java
Appel, Andrew W.
-
Data Mining and Machine Learning
Zaki, Mohammed J.