Distributed Maximum Matching Algorithm in General Graph with Iterative Multiple BSP Framework
Date Issued
2015
Date
2015
Author(s)
Shao, Fei
Abstract
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 problem as a maximum matching problem in a large general graph, and proposed a distributed matching algorithm with improved BSP framework to address this problem. Also, three optimization strategies are developed to enhance the performance of our proposed algorithm.
Subjects
distributed matching
parallel matching
maximum matching
iterative multiple BSP
Type
thesis
File(s)![Thumbnail Image]()
Loading...
Name
ntu-104-R02922164-1.pdf
Size
23.32 KB
Format
Adobe PDF
Checksum
(MD5):df85e549736fa405f1241fe69e93f947