{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T05:00:35Z","timestamp":1725858035274},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319405087"},{"type":"electronic","value":"9783319405094"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-40509-4_5","type":"book-chapter","created":{"date-parts":[[2016,6,16]],"date-time":"2016-06-16T22:00:05Z","timestamp":1466114405000},"page":"65-78","source":"Crossref","is-referenced-by-count":0,"title":["An Algorithm for k-Connectivity Under Pure SINR Model"],"prefix":"10.1007","author":[{"given":"Fl\u00e1vio","family":"Assis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,18]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Assis, F.: A deterministic and a randomized algorithm for approximating minimum spanning tree under the SINR model. In: Proceeding of the 8th IFIP Wireless and Mobile Networking Conference - WMNC (2015)","DOI":"10.1109\/WMNC.2015.41"},{"key":"5_CR2","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/s11276-005-5265-z","volume":"12","author":"M Bahramgiri","year":"2006","unstructured":"Bahramgiri, M., Hajiaghayi, M., Mirrokni, V.S.: Fault-tolerant and 3-dimensional distributed topology control algorithms in wireless multi-hop networks. Wirel. Netw. 12, 179\u2013188 (2006)","journal-title":"Wirel. Netw."},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Cheryian, J., V\u00e9gh, L.A.: Approximating minimum-cost k-node connected subgraphs via independence-free graphs. In: Proceedings of the IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS) (2013)","DOI":"10.1109\/FOCS.2013.12"},{"key":"5_CR4","unstructured":"Cornejo, A., Lynch, N.: Fault-tolerance through k-connectivity.In: Proceedings of IEEE International Conference on Robotics and Automation (ICRA): Workshop on Network Science and Systems Issues in Multi-Robot Autonomy (2010)"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1007\/978-3-642-41527-2_25","volume-title":"Distributed Computing","author":"S Daum","year":"2013","unstructured":"Daum, S., Gilbert, S., Kuhn, F., Newport, C.: Broadcast in the ad hoc SINR model. In: Afek, Y. (ed.) DISC 2013. LNCS, vol. 8205, pp. 358\u2013372. Springer, Heidelberg (2013)"},{"issue":"5","key":"5_CR6","doi-asserted-by":"crossref","first-page":"1095","DOI":"10.1137\/110855910","volume":"41","author":"J Fakcharoenphol","year":"2012","unstructured":"Fakcharoenphol, J., Laekhanukit, B.: An $$o(\\log ^2{k})$$ -approximation algorithm for the k-vertex connected spanning subgraph problem. SIAM J. Comput. 41(5), 1095\u20131109 (2012)","journal-title":"SIAM J. Comput."},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Fuchs, F., Wagner, D.: Arbitrary transmission power in the SINR model: local broadcasting, coloring and MIS. Technical report arXiv:1402.4994v2 (2014)","DOI":"10.1007\/978-3-319-09620-9_15"},{"issue":"6","key":"5_CR8","doi-asserted-by":"crossref","first-page":"1345","DOI":"10.1109\/TNET.2007.902680","volume":"15","author":"M Hajiaghayi","year":"2007","unstructured":"Hajiaghayi, M., Immorlica, N., Mirrokni, V.S.: Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks. IEEE\/ACM Trans. Networking 15(6), 1345\u20131358 (2007)","journal-title":"IEEE\/ACM Trans. Networking"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Halldorsson, M.M., Mitra, P.: Towards tight bounds for local broadcasting. In: FOMC (2012)","DOI":"10.1145\/2335470.2335472"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/978-3-642-41527-2_26","volume-title":"Distributed Computing","author":"T Jurdzinski","year":"2013","unstructured":"Jurdzinski, T., Kowalski, D.R., Rozanski, M., Stachowiak, G.: Distributed randomized broadcasting in wireless networks under the SINR model. In: Afek, Y. (ed.) DISC 2013. LNCS, vol. 8205, pp. 373\u2013387. Springer, Heidelberg (2013)"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/978-3-642-40164-0_20","volume-title":"Fundamentals of Computation Theory","author":"T Jurdzinski","year":"2013","unstructured":"Jurdzinski, T., Kowalski, D.R., Stachowiak, G.: Distributed deterministic broadcasting in uniform-power ad hoc wireless networks. In: G\u0105sieniec, L., Wolter, F. (eds.) FCT 2013. LNCS, vol. 8070, pp. 195\u2013209. Springer, Heidelberg (2013)"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Khan, A.M.: Distributed Approximation Algorithms for Minimum Spanning Trees and Other Related Problems with Applications to Wireless Ad Hoc Networks. Ph.d thesis, Purdue University (2007)","DOI":"10.1007\/s00446-007-0047-8"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Khan, M., Kumar, V.S.A., Pandurangan, G., Pei, G.: A fast distributed approximation algorithm for minimum spanning trees in the SINR model. Technical report arXiv:1206.1113v1 , June 2012","DOI":"10.1007\/978-3-642-33651-5_32"},{"issue":"1\u20133","key":"5_CR14","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/j.tcs.2007.05.028","volume":"385","author":"M Khan","year":"2007","unstructured":"Khan, M., Pandurangan, G., Anil Kumar, V.S.: A simple randomized scheme for constructing low-weight k-connected spanning subgraphs with applications to distributed algorithms. Theor. Comput. Sci. 385(1\u20133), 101\u2013114 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/978-3-642-33651-5_32","volume-title":"Distributed Computing","author":"M Khan","year":"2012","unstructured":"Khan, M., Pandurangan, G., Pei, G., Vullikanti, A.K.S.: Brief announcement: a fast distributed approximation algorithm for minimum spanning trees in the SINR model. In: Aguilera, M.K. (ed.) DISC 2012. LNCS, vol. 7611, pp. 409\u2013410. Springer, Heidelberg (2012)"},{"key":"5_CR16","volume-title":"Approximation Algorithms for NP-Hard Problems","author":"S Khuller","year":"1995","unstructured":"Khuller, S.: Approximation algorithms for finding highly connected subgraphs. In: Hochbaum, D.S. (ed.) Approximation Algorithms for NP-Hard Problems. PWS Publishing Company, Boston (1995). Chapter 6"},{"issue":"1","key":"5_CR17","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1137\/S0097539703435753","volume":"35","author":"G Kortsarz","year":"2005","unstructured":"Kortsarz, G., Nutov, Z.: Approximating k-node connected subgraphs via critical paths. SIAM J. Comput. 35(1), 247\u2013257 (2005)","journal-title":"SIAM J. Comput."},{"key":"5_CR18","volume-title":"Handbook of Approximation Algorithms and Metaheuristics","author":"G Kortsarz","year":"2007","unstructured":"Kortsarz, G., Nutov, Z.: Approximating minimum-cost connectivity problems. In: Gonzalez, T.F. (ed.) Handbook of Approximation Algorithms and Metaheuristics. Chapman and Hall CRC, Boca Raton (2007). Chapter 58"},{"issue":"4","key":"5_CR19","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1109\/TPDS.2006.51","volume":"17","author":"N Li","year":"2006","unstructured":"Li, N., Hou, J.C.: Localized fault-tolerant topology control in wireless ad hoc networks. IEEE Trans. Parallel Distrib. Syst. 17(4), 307\u2013320 (2006)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"5_CR20","unstructured":"Nolte, T., Hansson, H., Lo Bello, L.: Wireless automotive communications. In: Proceedings of the 4th International Workshop on Real Time Networks (RTN) (2005)"},{"key":"5_CR21","unstructured":"Nutov, Z.: Approximating minimum-cost edge-covers of crossing biset-families. Technical report arXiv:1207.4366v1 (2012)"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Saha, I., Sambasivan, L.K., Patro, R.K., Ghosh, S.K.: Distributed fault-tolerant topology control in static and mobile wireless sensor networks. In: Proceedings of the 2nd International Conference on Communication Systems Software and Middleware, COMSWARE (2007)","DOI":"10.1109\/COMSWA.2007.382434"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Scheideler, C., Richa, A.W., Santi, P.: An O(log n) dominating set protocol for wireless ad-hoc networks under the physical interference model. In: MobiHoc (2008)","DOI":"10.1145\/1374618.1374632"},{"issue":"2","key":"5_CR24","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/s11276-008-0139-9","volume":"16","author":"B Thallner","year":"2010","unstructured":"Thallner, B., Moser, H., Schmid, U.: Topology control for fault-tolerant communication in wireless ad hoc networks. Wirel. Netw. 16(2), 387\u2013404 (2010)","journal-title":"Wirel. Netw."}],"container-title":["Lecture Notes in Computer Science","Ad-hoc, Mobile, and Wireless Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-40509-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T17:12:39Z","timestamp":1656695559000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-40509-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319405087","9783319405094"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-40509-4_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}