A partitioning algorithm for minimum weighted Euclidean matching
- 28 February 1984
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 18 (2) , 59-62
- https://doi.org/10.1016/0020-0190(84)90024-3
Abstract
No abstract availableKeywords
This publication has 10 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
- Divide and Conquer Heuristics for Minimum Weighted Euclidean MatchingSIAM Journal on Computing, 1983
- A Fast Algorithm for the Euclidean Traveling Salesman Problem, Optimal with Probability OneSIAM Journal on Computing, 1982
- On a Greedy Heuristic for Complete MatchingSIAM Journal on Computing, 1981
- Subadditive Euclidean Functionals and Nonlinear Growth in Geometric ProbabilityThe Annals of Probability, 1981
- Worst case bounds for the Euclidean matching problemComputers & Mathematics with Applications, 1981
- Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the PlaneMathematics of Operations Research, 1977
- Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965