A fast heuristic based on spacefilling curves for minimum-weight matching in the plane
- 8 November 1983
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 17 (4) , 177-180
- https://doi.org/10.1016/0020-0190(83)90036-4
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- A survey of heuristics for the weighted matching problemNetworks, 1983
- Heuristics for planar minimum-weight perfect metchingsNetworks, 1983
- The Travelling Salesman Problem and Minimum Matching in the Unit SquareSIAM Journal on Computing, 1983
- An O(N log N) planar travelling salesman heuristic based on spacefilling curvesOperations Research Letters, 1982
- 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