Distributed Maximum Matching Algorithm in General Graph with Iterative Multiple BSP Framework
碩士 === 國立臺灣大學 === 資訊工程學研究所 === 104 === In order to reduce the transportation cost of empty containers, ocean carrier companies may exchange their empty containers in various ports. Leasing companies want to find the maximum exchangeable container pairs to minimize the cost. We formulate this probl...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2015
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/73786243152672192835 |