Network Flow Algorithms (Paperback)

Williamson, David P.

Network Flow Algorithms (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.

商品描述(中文翻譯)

網路流理論已被應用於多個學科，包括理論計算機科學、運籌學和離散數學，用於模擬不僅是貨物和信息運輸中的問題，還包括從計算機視覺中的圖像分割問題到判定棒球隊何時被淘汰的廣泛應用。這本研究生教材和參考書提供了一個簡明、統一的觀點，介紹了各種高效的組合算法，用於解決網路流問題，其中包括許多其他書籍中找不到的結果。它涵蓋了最大流、最小成本流、廣義流、多商品流和全局最小割，並介紹了最近關於計算電流流動的研究成果，以及這些流動在網路流理論中的經典問題的最新應用。

作者簡介

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.

作者簡介(中文翻譯)

David P. Williamson 是康奈爾大學（紐約州）運籌學與資訊工程學院的教授。他在離散優化領域的研究成果獲得多項獎項，包括由美國數學學會和數學規劃學會贊助的2000年 Fulkerson 獎。他與 David B. Shmoys 合著的前一本書《近似算法設計》（劍橋大學出版社，2011年）獲得了2013年 INFORMS Lanchester 獎。他曾擔任多個編輯委員會的成員，並擔任過 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. 初步準備工作：最短路徑演算法
2. 最大流演算法
3. 全域最小割演算法
4. 更多最大流演算法
5. 最小成本循環演算法
6. 一般化流演算法
7. 多商品流演算法
8. 電流演算法
9. 未解決問題

類似商品