Solving the Euclidean bottleneck biconnected edge subgraph problem by 2-relative neighborhood graphs

Aho, 1974 M.S. Chang, C.Y. Tang and R.C.T. Lee, Solving the Euclidean bottleneck matching problem by k-relative neighborhood graph, Algorithmica, to appear. Chang, 1990, 20-relative neighborhood graphs are Hamiltonian, 450, 53 Edelsbrunner, 1897, Algorithms in Combinatorial Geometry, 10 Edmonds, 1970, Bottleneck extrema, J. Combin. Theory, 8, 299, 10.1016/S0021-9800(70)80083-7 Garey, 1979 Garfinkel, 1978, The bottleneck traveling salesperson problem: algorithms and probabilistic analysis, J. ACM, 25, 435, 10.1145/322077.322086 Hochbaum, 1986, A unified approach to approximation algorithms for bottleneck problems, J. ACM, 33, 535, 10.1145/5925.5933 Katajainen, 1986, Computing relative neighborhood graphs in the plane, Pattern Recognition, 19, 221, 10.1016/0031-3203(86)90012-9 Lau, 1980, Finding a Hamiltonian cycle in the square of a block Lawler, 1985 Lee, 1982, On k-nearest neighbor Voronoi diagrams in the plane, IEEE Trans. Comput., 31, 478 Parker, 1984, Guaranteed performance heuristics for the bottleneck traveling salesperson problem, Oper. Res. Lett., 2, 269, 10.1016/0167-6377(84)90077-4 Su, 1990, The k-Gabriel graphs and their applications, 450, 66 Toussaint, 1980, The relative neighborhood graph of a finite planar set, Pattern Recognition, 12, 261, 10.1016/0031-3203(80)90066-7