On a Greedy Heuristic for Complete Matching
- 1 November 1981
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 10 (4) , 676-681
- https://doi.org/10.1137/0210050
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Automatische Abbildung eines planaren Graphen in die Ebene mit beliebig vorgebbaren Örtern der KnotenbilderComputing, 1978
- An Analysis of Several Heuristics for the Traveling Salesman ProblemSIAM Journal on Computing, 1977
- Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the PlaneMathematics of Operations Research, 1977
- Closest-point problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1975
- Two dimensional wave propagation through nonlinear mediaJournal of Computational Physics, 1969
- Linear Programming and ExtensionsPublished by Walter de Gruyter GmbH ,1963