Solving the Euclidean bottleneck matching problem byk-relative neighborhood graphs
- 1 December 1992
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 8 (1) , 177-194
- https://doi.org/10.1007/bf01758842
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Algorithms for two bottleneck optimization problemsJournal of Algorithms, 1988
- Computing relative neighbourhood graphs in the planePattern Recognition, 1986
- A scaling algorithm for weighted matching on general graphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- The relative neighbourhood graph of a finite planar setPattern Recognition, 1980
- Assignment and Matching Problems: Solution Methods with FORTRAN-ProgramsPublished by Springer Nature ,1980