A new class of heuristic algorithms for weighted perfect matching
Work
Year: 1988
Type: article
Abstract: The minimum-weight perfect matching problem for complete graphs of n vertices with edge weights satisfying the triangle inequality is considered. For each nonnegative integer k ≤ log 3 n , and for any... more
Source: Journal of the ACM
Institution Rutgers, The State University of New Jersey
Cites: 23
Cited by: 12
Related to: 10
FWCI:
Citation percentile (by year/subfield): 66.43
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Sustainable Development Goal Reduced inequalities
Open Access status: bronze