Computing minimum-weight perfect matchings Export

@article{citeulike:1835993, abstract = {We make several observations on the implementation of Edmonds' blossom algorithm for solving minimum-weight perfect-matching problems and we present computational results for geometric problem instances ranging in size from 1,000 nodes up to 5,000,000 nodes. A key feature in our implementation is the use of multiple search trees with an individual dual-change \" for each tree. As a benchmark of the algorithm's performance, solving a 100,000 node geometric instance on a 200 Mhz Pentium-Pro...}, author = {Cook, W. and Rohe, A.}, citeulike-article-id = {1835993}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.38.9983}, journal = {INFORMS Journal on Computing}, keywords = {algorithms, matching}, pages = {138--148}, posted-at = {2007-10-29 15:54:56}, priority = {2}, title = {Computing minimum-weight perfect matchings}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.38.9983}, volume = {11}, year = {1999} }

TY - JOUR ID - citeulike:1835993 L3 - citeulike-article-id:1835993 N2 - We make several observations on the implementation of Edmonds' blossom algorithm for solving minimum-weight perfect-matching problems and we present computational results for geometric problem instances ranging in size from 1,000 nodes up to 5,000,000 nodes. A key feature in our implementation is the use of multiple search trees with an individual dual-change " for each tree. As a benchmark of the algorithm's performance, solving a 100,000 node geometric instance on a 200 Mhz Pentium-Pro... JF - INFORMS Journal on Computing EP - 148 TI - Computing minimum-weight perfect matchings VL - 11 SP - 138 KW - algorithms KW - matching AU - Cook, W AU - Rohe, A PY - 1999/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.38.9983 ER -