{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T03:39:56Z","timestamp":1725680396240},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642300530"},{"type":"electronic","value":"9783642300547"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30054-7_29","type":"book-chapter","created":{"date-parts":[[2012,5,15]],"date-time":"2012-05-15T06:42:55Z","timestamp":1337064175000},"page":"366-377","source":"Crossref","is-referenced-by-count":0,"title":["Relay Placement for Two-Connectivity"],"prefix":"10.1007","author":[{"given":"Gruia","family":"Calinescu","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"29_CR1","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1109\/TNET.2009.2024941","volume":"18","author":"J.-L. Bredin","year":"2010","unstructured":"Bredin, J.-L., Demaine, E.-D., Hajiaghayi, M.-T., Rus, D.: Deploying sensor networks with guaranteed fault tolerance. IEEE\/ACM Trans. Netw.\u00a018, 216\u2013228 (2010)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Bryant, V.: Metric Spaces: Iteration and Application. Cambridge University Press (1985)","DOI":"10.1017\/9781139171854"},{"key":"29_CR3","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1023\/A:1008384012064","volume":"18","author":"D. Chen","year":"2000","unstructured":"Chen, D., Du, D.-Z., Hu, X., Lin, G., Wang, L., Xue, G.: Approximation for Steiner trees with minimum number of Steiner points. Journal of Global Optimization\u00a018, 17\u201333 (2000)","journal-title":"Journal of Global Optimization"},{"issue":"3","key":"29_CR4","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s11276-006-0724-8","volume":"14","author":"X. Cheng","year":"2008","unstructured":"Cheng, X., Du, D.-Z., Wang, L., Xu, B.: Relay sensor placement in wireless sensor networks. Wirel. Netw.\u00a014(3), 347\u2013355 (2008)","journal-title":"Wirel. Netw."},{"key":"29_CR5","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1016\/0024-3795(89)90469-2","volume":"114\/115","author":"A. Frank","year":"1989","unstructured":"Frank, A., Tardos, E.: An application of submodular flows. Linear Algebra and its Applications\u00a0114\/115, 320\u2013348 (1989)","journal-title":"Linear Algebra and its Applications"},{"key":"29_CR6","unstructured":"Frank, A.: Connections in Combinatorial Optimization. Oxford University Press (2011)"},{"key":"29_CR7","unstructured":"Gabow, H.N.: A representation for crossing set families with applications to submodular flow problems. In: Proc. SODA, pp. 202\u2013211 (1993)"},{"issue":"5","key":"29_CR8","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.ipl.2007.06.009","volume":"104","author":"K. Hvam","year":"2007","unstructured":"Hvam, K., Reinhardt, L., Winter, P., Zachariasen, M.: Bounding component sizes of two-connected Steiner networks. Inf. Process. Lett.\u00a0104(5), 159\u2013163 (2007)","journal-title":"Inf. Process. Lett."},{"key":"29_CR9","unstructured":"Hvam, K., Reinhardt, L., Winter, P., Zachariasen, M.: Some structural and geometric properties of two-connected Steiner networks. In: Proc. CATS. CRPIT, vol.\u00a065, pp. 85\u201390. Australian Computer Society (2007)"},{"key":"29_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-642-18318-8_14","volume-title":"Approximation and Online Algorithms","author":"L. Kamma","year":"2011","unstructured":"Kamma, L., Nutov, Z.: Approximating Survivable Networks with Minimum Number of Steiner Points. In: Jansen, K., Solis-Oba, R. (eds.) WAOA 2010. LNCS, vol.\u00a06534, pp. 154\u2013165. Springer, Heidelberg (2011)"},{"key":"29_CR11","unstructured":"Kashyap, A.: Robust design of wireless networks. Ph.D. thesis. University of Maryland (2006)"},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"Kashyap, A., Khuller, S., Shayman, M.: Relay placement for higher order connectivity in wireless sensor networks. In: Proceedings of 25th IEEE International Conference on Computer Communications, INFOCOM 2006, pp. 1\u201312 (2006)","DOI":"10.1109\/INFOCOM.2006.273"},{"key":"29_CR13","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1006\/jagm.1996.0052","volume":"21","author":"S. Khuller","year":"1996","unstructured":"Khuller, S., Raghavachari, B.: Improved approximation algorithms for uniform connectivity problems. Journal of Algorithms\u00a021, 433\u2013450 (1996)","journal-title":"Journal of Algorithms"},{"key":"29_CR14","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1145\/174652.174654","volume":"41","author":"S. Khuller","year":"1994","unstructured":"Khuller, S., Vishkin, U.: Biconnectivity approximation and graph carvings. J. ACM\u00a041, 214\u2013235 (1994)","journal-title":"J. ACM"},{"key":"29_CR15","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S0020-0190(98)00201-4","volume":"69","author":"G. Lin","year":"1999","unstructured":"Lin, G., Xue, G.: Steiner tree problem with minimum number of Steiner points and bounded edge-length. Information Processing Letters\u00a069, 53\u201357 (1999)","journal-title":"Information Processing Letters"},{"key":"29_CR16","unstructured":"Luebke, E.L.: k-Connected Steiner Network Problems. Ph.D. thesis, University of North Carolina (2002)"},{"issue":"3","key":"29_CR17","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/S0167-6377(99)00068-1","volume":"26","author":"E.L. Luebke","year":"2000","unstructured":"Luebke, E.L., Provan, J.S.: On the structure and complexity of the 2-connected Steiner network problem in the plane. Oper. Res. Lett.\u00a026(3), 111\u2013116 (2000)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"29_CR18","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.aml.2005.03.011","volume":"19","author":"H. Martini","year":"2006","unstructured":"Martini, H., Swanepoel, K.J.: Low-degree minimal spanning trees in normed spaces. Applied Mathematics Letters\u00a019(2), 122\u2013125 (2006)","journal-title":"Applied Mathematics Letters"},{"issue":"4","key":"29_CR19","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0020-0190(00)00095-8","volume":"75","author":"I.I. M\u0103ndoiu","year":"2000","unstructured":"M\u0103ndoiu, I.I., Zelikovsky, A.Z.: A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points. Inf. Process. Lett.\u00a075(4), 165\u2013167 (2000)","journal-title":"Inf. Process. Lett."},{"issue":"19","key":"29_CR20","doi-asserted-by":"publisher","first-page":"1136","DOI":"10.1016\/j.ipl.2009.07.013","volume":"109","author":"Z. Nutov","year":"2009","unstructured":"Nutov, Z., Yaroshevitch, A.: Wireless network design via 3-decompositions. Inf. Process. Lett.\u00a0109(19), 1136\u20131140 (2009)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"29_CR21","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF02570700","volume":"14","author":"G. Robins","year":"1995","unstructured":"Robins, G., Salowe, J.S.: Low-degree minimum spanning trees. Discrete & Computational Geometry\u00a014(2), 151\u2013165 (1995)","journal-title":"Discrete & Computational Geometry"},{"issue":"3","key":"29_CR22","doi-asserted-by":"publisher","first-page":"1230","DOI":"10.1109\/TWC.2009.051053","volume":"8","author":"F. Wang","year":"2009","unstructured":"Wang, F., Thai, M.T., Du, D.-Z.: On the construction of 2-connected virtual backbone in wireless networks. IEEE Transactions on Wireless Communications\u00a08(3), 1230\u20131237 (2009)","journal-title":"IEEE Transactions on Wireless Communications"},{"issue":"3","key":"29_CR23","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1002\/jgt.3190110309","volume":"11","author":"R.W. Whitty","year":"1987","unstructured":"Whitty, R.W.: Vertex-disjoint paths and edge-disjoint branchings in directed graphs. J. Graph Theory\u00a011(3), 349\u2013358 (1987)","journal-title":"J. Graph Theory"},{"issue":"4","key":"29_CR24","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/j.orl.2004.07.010","volume":"33","author":"P. Winter","year":"2005","unstructured":"Winter, P., Zachariasen, M.: Two-connected Steiner networks: structural properties. Oper. Res. Lett.\u00a033(4), 395\u2013402 (2005)","journal-title":"Oper. Res. Lett."}],"container-title":["Lecture Notes in Computer Science","NETWORKING 2012"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30054-7_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:41:58Z","timestamp":1558298518000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30054-7_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642300530","9783642300547"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30054-7_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}