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

Authors:
M. S. Chang;C. Y. Tang;R. C. T. Lee
Affiliations:
-;-;-
Venue:
Discrete Applied Mathematics
Year:
1992

Citing 0
Cited 3

kthorder geometric spanners for wireless ad hoc networks

ICDCIT'11 Proceedings of the 7th international conference on Distributed computing and internet technology
The bottleneck 2-connected k-Steiner network problem for k≤2

Discrete Applied Mathematics
Minmax regret solutions for minimax optimization problems with uncertainty

Operations Research Letters

Quantified Score

Hi-index	0.05

Visualization

Abstract