Connectivity graphs of uncertain regions

In this paper we provide an algorithmic study of connectivity problems with neighborhoods: Given a family of geometric sets, choose one point per set, such that the length of the longest edge in a connecting structure is minimized. We show that even simple geometric scenarios give rise to problems that are NP-hard to approximate; on the positive side, we give approximation and exact algorithms.

By: Erin Chambers; Alejandro Erickson; Sándor Fekete; Jon Lenchner; Jeff Sember; Venkatesh Srinivasan; Ulrike Stege; Svetlana Stolpner; Christophe Weibel; Sue Whitesides

Published in: RC24988 in 2010


This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.


Questions about this service can be mailed to .