Probabilistic analysis of divide-and-conquer heuristics for minimum weighted euclidean matching
- 1 March 1983
- Vol. 13 (1) , 49-66
- https://doi.org/10.1002/net.3230130104
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- On a Greedy Heuristic for Complete MatchingSIAM Journal on Computing, 1981
- An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on GraphsJournal of the ACM, 1976