We study a generalization of the well known bottleneck spanning tree problem called Best Case Connectivity with Uncertainty: Given a family of geometric regions, choose one point per region, such that the length of the longest edge in a spanning tree of a disc intersection graph is minimized. We show that this problem is NP-hard even for very simple scenarios such as line segments and squares. We also give exact and approximation algorithms for the case of line segments and unit discs respectively. © 2010 Springer-Verlag.
CITATION STYLE
Chambers, E., Erickson, A., Fekete, S., Lenchner, J., Sember, J., Venkatesh, S., … Whitesides, S. (2010). Connectivity graphs of uncertainty regions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6507 LNCS, pp. 434–445). https://doi.org/10.1007/978-3-642-17514-5_37
Mendeley helps you to discover research relevant for your work.