Network Flow Algorithms (Hardcover)
暫譯: 網路流演算法 (精裝版)

Williamson, David P.

Network Flow Algorithms (Hardcover)

買這商品的人也買了...

相關主題

商品描述

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.

商品描述(中文翻譯)

網路流理論已被應用於多個領域，包括理論計算機科學、運籌學和離散數學，不僅用來建模貨物和資訊的運輸問題，還涵蓋了從計算機視覺中的影像分割問題到決定一支棒球隊是否已經被淘汰的各種應用。本書是一本研究生教材和參考書，提供了對各種有效組合算法在網路流問題上的簡潔統一觀點，包括許多在其他書籍中找不到的結果。內容涵蓋最大流、最小成本流、廣義流、多商品流和全局最小切割，並介紹了計算電流的最新研究以及這些流在網路流理論中的經典問題上的最新應用。

作者簡介

David P. Williamson, Cornell University, New York
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.

作者簡介(中文翻譯)

大衛·P·威廉姆森，美國紐約康奈爾大學

大衛·P·威廉姆森是美國紐約康奈爾大學運籌學與資訊工程學院的教授。他因在離散優化方面的研究而獲得多項獎項，包括2000年由美國數學學會和數學規劃學會贊助的福克森獎。他的前一本書《近似演算法的設計》（劍橋大學出版社，2011年），與大衛·B·施莫伊斯共同撰寫，獲得2013年INFORMS蘭徹斯特獎。他曾擔任多個編輯委員會成員，並曾擔任《SIAM離散數學期刊》的主編。他是ACM和SIAM的會士。

目錄大綱

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.

目錄大綱(中文翻譯)

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.

類似商品