Heuristics for planar minimum-weight perfect metchings
Authors:
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- On a Greedy Heuristic for Complete MatchingSIAM Journal on Computing, 1981
- Linear-time approximation algorithms for finding the minimum-weight perfect matching on a planeInformation Processing Letters, 1981