Bounded Length, 2-Edge Augmentation of Geometric Planar Graphs
Algorithms for the construction of spanning planar subgraphs of Unit Disk Graphs (UDGs) do not ensure connectivity of the resulting graph under single edge deletion. To overcome this deficiency, in this paper we address the problem of augmenting the edge set of planar geometric graphs with straight line edges of bounded length so that the resulting graph is planar and 2-edge connected. We give bounds on the number of newly added straight-line edges and show that such edges can be of length at most 3 times the max length of the edges of the original graph; also 3 is shown to be optimal. It is shown to be NP-hard to augment a geometric planar graph to a 2-edge connected geometric planar with the minimum number of new edges of a given bounded length. Further, we prove that there is no local algorithm for augmenting a planar UDG into a 2-edge connected planar graph with straight line edges.
keywords and PhrasesAugmentation Deletion 2-edge connected Geometric Local Minimum number of edges Planar UDG
Unable to display preview. Download preview PDF.
- 3.Dong, Q., Bejerano, Y.: Building Robust Nomadic Wireless Mesh Networks Using Directional Antennas. In: IEEE INFOCOM 2008, The 27th Conference on Computer Communications, pp. 1624–1632 (2008)Google Scholar
- 6.Jothi, R., Raghavachari, B., Varadarajan, S.: A 5/4-Approximation Algorithm for Minimum 2-Edge-Connectivity. In: SODA 2003: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 725–734. Society for Industrial and Applied Mathematics, Philadelphia (2003)Google Scholar
- 8.Kant, G., Bodlaender, H.: Planar graph augmentation problems. In: Workshop on Algorithms and Data Structures, pp. 286–298 (1991)Google Scholar
- 9.Kranakis, E., Singh, H., Urrutia, J.: Compass routing on geometric networks. In: Proc. 11th Canadian Conference on Computational Geometry (1999)Google Scholar