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.
"Sinopsis" puede pertenecer a otra edición de este libro.
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
Librería: Grand Eagle Retail, Bensenville, IL, Estados Unidos de America
Paperback. Condición: new. Paperback. 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. 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. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Nº de ref. del artículo: 9781316636831
Cantidad disponible: 1 disponibles
Librería: California Books, Miami, FL, Estados Unidos de America
Condición: New. Nº de ref. del artículo: I-9781316636831
Cantidad disponible: Más de 20 disponibles
Librería: Revaluation Books, Exeter, Reino Unido
Paperback. Condición: Brand New. 314 pages. 9.00x6.00x1.00 inches. In Stock. This item is printed on demand. Nº de ref. del artículo: __1316636836
Cantidad disponible: 1 disponibles
Librería: Books Puddle, New York, NY, Estados Unidos de America
Condición: New. Nº de ref. del artículo: 26376453508
Cantidad disponible: 1 disponibles
Librería: Majestic Books, Hounslow, Reino Unido
Condición: New. Nº de ref. del artículo: 369591899
Cantidad disponible: 1 disponibles
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Condición: New. In. Nº de ref. del artículo: ria9781316636831_new
Cantidad disponible: Más de 20 disponibles
Librería: Biblios, Frankfurt am main, HESSE, Alemania
Condición: New. Nº de ref. del artículo: 18376453518
Cantidad disponible: 1 disponibles
Librería: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Condición: New. Nº de ref. del artículo: V9781316636831
Cantidad disponible: Más de 20 disponibles
Librería: THE SAINT BOOKSTORE, Southport, Reino Unido
Paperback / softback. Condición: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days. Nº de ref. del artículo: C9781316636831
Cantidad disponible: Más de 20 disponibles
Librería: Revaluation Books, Exeter, Reino Unido
Paperback. Condición: Brand New. 314 pages. 9.00x6.00x1.00 inches. In Stock. Nº de ref. del artículo: x-1316636836
Cantidad disponible: 2 disponibles