Heuristics for planar minimum-weight perfect metchings
- 1 March 1983
- Vol. 13 (1), 67-92
- https://doi.org/10.1002/net.3230130105
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