Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abellanas, M., GarcÃa, A., Hurtado, F., Tejel, J., Urrutia, J.: Augmenting the connectivity of geometric graphs. Comp. Geom. Theory Appl. 40(3), 220–230 (2008)
Cheriyan, J., Sebö, A., Szigeti, Z.: An Improved Approximation Algorithm for Minimum Size 2-Edge Connected Spanning Subgraphs. In: Bixby, R.E., Boyd, E.A., RÃos-Mercado, R.Z. (eds.) IPCO 1998. LNCS, vol. 1412, pp. 126–136. Springer, Heidelberg (1998)
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)
Eswaran, K.P., Tarjan, R.E.: Augmentation problems. SIAM J. Comput. 5, 653–665 (1976)
Jackson, B., Jordán, T.: Independence free graphs and vertex connectivity augmentation. J. Comb. Theory Ser. B 94(1), 31–77 (2005)
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)
Kant, G.: Augmenting outerplanar graphs. J. Algorithms 21(1), 1–25 (1996)
Kant, G., Bodlaender, H.: Planar graph augmentation problems. In: Workshop on Algorithms and Data Structures, pp. 286–298 (1991)
Kranakis, E., Singh, H., Urrutia, J.: Compass routing on geometric networks. In: Proc. 11th Canadian Conference on Computational Geometry (1999)
Peleg, D.: Distributed computing: a locality-sensitive approach. Society for Industrial and Applied Mathematics, Philadelphia (2000)
Rutter, I., Wolff, A.: Augmenting the connectivity of planar and geometric graphs. Electronic Notes in Discrete Mathematics 31, 53–56 (2008)
Vempala, S., Vetta, A.: Factor 4/3 Approximations for Minimum 2-Connected Subgraphs. In: Jansen, K., Khuller, S. (eds.) APPROX 2000. LNCS, vol. 1913, pp. 262–273. Springer, Heidelberg (2000)
Watanabe, T., Nakamura, A.: Edge-connectivity augmentation problems. J. Comput. Syst. Sci. 35(1), 96–144 (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kranakis, E., Krizanc, D., Ponce, O.M., Stacho, L. (2010). Bounded Length, 2-Edge Augmentation of Geometric Planar Graphs. In: Wu, W., Daescu, O. (eds) Combinatorial Optimization and Applications. COCOA 2010. Lecture Notes in Computer Science, vol 6508. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17458-2_31
Download citation
DOI: https://doi.org/10.1007/978-3-642-17458-2_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17457-5
Online ISBN: 978-3-642-17458-2
eBook Packages: Computer ScienceComputer Science (R0)