Computing Minimum-Weight Perfect Matchings

Computing Minimum-Weight Perfect Matchings (1999)

by William Cook , Andre Rohe

Venue:	INFORMS
Citations:	67 - 2 self

User correction supplied by mph

Datum	Value	Source
TITLE	Computing Minimum-Weight Perfect Matchings	user correction
AUTHOR NAME	William Cook	user correction
AUTHOR NAME	Andre Rohe	user correction
ABSTRACT	We make several observations on the implementation of Edmonds’ blossom algorithm for solving minimum-weight perfectmatching 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 computer takes approximately 3 minutes.	user correction
YEAR	1999	user correction
VENUE	INFORMS	user correction
CITATIONS	65 found	ParsCit 1.0