Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching
- 1 February 1983
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 12 (1) , 118-143
- https://doi.org/10.1137/0212008
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Probabilistic analysis of divide-and-conquer heuristics for minimum weighted euclidean matchingNetworks, 1983
- The Travelling Salesman Problem and Minimum Matching in the Unit SquareSIAM Journal on Computing, 1983
- On a Greedy Heuristic for Complete MatchingSIAM Journal on Computing, 1981
- Worst case bounds for the Euclidean matching problemComputers & Mathematics with Applications, 1981
- Decomposable searching problems I. Static-to-dynamic transformationJournal of Algorithms, 1980
- An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on GraphsJournal of the ACM, 1976