{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:22:07Z","timestamp":1742916127888,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319971629"},{"type":"electronic","value":"9783319971636"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-97163-6_5","type":"book-chapter","created":{"date-parts":[[2018,7,13]],"date-time":"2018-07-13T13:59:50Z","timestamp":1531490390000},"page":"51-62","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Finding Degree Constrained k-Cardinality Minimum Spanning Trees for Wireless Sensor Networks"],"prefix":"10.1007","author":[{"given":"Pablo","family":"Adasme","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ismael","family":"Soto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabian","family":"Seguel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,7,14]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/j.asoc.2018.03.008","volume":"67","author":"P Adasme","year":"2018","unstructured":"Adasme, P.: p-Median based formulations with backbone facility locations. Appl. Soft Comput. 67, 261\u2013275 (2018)","journal-title":"Appl. Soft Comput."},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.eswa.2018.01.031","volume":"100","author":"P Adasme","year":"2018","unstructured":"Adasme, P., Andrade, R., Leung, J., Lisser, A.: Improved solution strategies for dominating trees. Expert Syst. Appl. 100, 30\u201340 (2018)","journal-title":"Expert Syst. Appl."},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/j.comnet.2016.11.011","volume":"112","author":"P Adasme","year":"2017","unstructured":"Adasme, P., Andrade, R., Lisser, A.: Minimum cost dominating tree sensor networks under probabilistic constraints. Comput. Netw. 112, 208\u2013222 (2017)","journal-title":"Comput. Netw."},{"key":"5_CR4","unstructured":"Andrade, R.: The spanning tree polytope revisited, Relatorio T\u00e9cnico, DEMA-RCA-2014A. Universidade Federal do Cear\u00e1, Departamento de Estat\u00edstica e Matem\u00e1tica Aplicada (2014)"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1016\/j.dam.2005.06.011","volume":"154","author":"R Andrade","year":"2006","unstructured":"Andrade, R., Lucena, A., Maculan, N.: Using Lagrangian dual information to generate degree constrained spanning trees. Discrete Appl. Math. 154, 703\u2013717 (2006)","journal-title":"Discrete Appl. Math."},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1145\/290179.290180","volume":"45","author":"S Arora","year":"1998","unstructured":"Arora, S.: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J. ACM 45, 753\u2013782 (1998)","journal-title":"J. ACM"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"2131","DOI":"10.1109\/JSEN.2018.2791487","volume":"18","author":"R Al-Zaidi","year":"2018","unstructured":"Al-Zaidi, R., Woods, J., Al-Khalidi, M., Hu, H.: Building novel VHF-based wireless sensor networks for the internet of marine things. IEEE Sens. J. 18, 2131\u20132144 (2018)","journal-title":"IEEE Sens. J."},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1002\/1097-0037(200103)37:2<74::AID-NET2>3.0.CO;2-E","volume":"37","author":"L Caccetta","year":"2001","unstructured":"Caccetta, L., Hill, S.P.: A branch and cut method for the degree-constrained minimum spanning tree problem. Networks 37, 74\u201383 (2001)","journal-title":"Networks"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1142\/S021926590200063X","volume":"3","author":"M Cardei","year":"2002","unstructured":"Cardei, M., MacCallum, D., Cheng, X.: Wireless sensor networks with energy efficient organization. J. Interconnect. Netw. 3, 3\u20134 (2002)","journal-title":"J. Interconnect. Netw."},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1109\/JIOT.2017.2782367","volume":"5","author":"Z Chu","year":"2018","unstructured":"Chu, Z., Zhou, F., Zhu, Z., Hu, R.Q., Xiao, P.: Wireless powered sensor networks for internet of things: maximum throughput and optimal power allocation. IEEE Internet Things 5, 310\u2013321 (2018)","journal-title":"IEEE Internet Things"},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s11276-010-0262-2","volume":"17","author":"E Bulut","year":"2011","unstructured":"Bulut, E., Korpeoglu, I.: Sleep scheduling with expected common coverage in wireless sensor networks. Wirel. Netw. 17, 19\u201340 (2011)","journal-title":"Wirel. Netw."},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0167-6377(91)90083-2","volume":"10","author":"M Desrochers","year":"1991","unstructured":"Desrochers, M., Laporte, G.: Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints. Oper. Res. Lett. 10, 27\u201336 (1991)","journal-title":"Oper. Res. Lett."},{"key":"5_CR13","first-page":"128","volume":"8","author":"L Euler","year":"1736","unstructured":"Euler, L.: Solutio problematis ad geometriam situs pertinentis. Comment. Acad. Sci. Imp. Petrop. 8, 128\u2013140 (1736). Reprinted and translated in Biggs, N.L., Lloyd, E.K., Wilson, R.J.: Graph Theory, pp. 1736\u20131936. Oxford University Press (1976)","journal-title":"Comment. Acad. Sci. Imp. Petrop."},{"key":"5_CR14","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)"},{"issue":"4","key":"5_CR15","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1287\/ijoc.2013.0589","volume":"26","author":"B Gendron","year":"2014","unstructured":"Gendron, B., Lucena, A., de Cunha, A., Simonetti, L.: Benders decomposition, branch-and-cut, and hybrid algorithms for the minimum connected dominating set problem. INFORMS J. Comput. 26(4), 645\u2013657 (2014)","journal-title":"INFORMS J. Comput."},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1109\/TNET.2005.863478","volume":"14","author":"H Gupta","year":"2006","unstructured":"Gupta, H., Zhou, Z., Das, S.R., Gu, Q.: Connected sensor cover: self-organization of sensor networks for efficient query execution. IEEE\/ACM Trans. Netw. 14, 55\u201367 (2006)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"5_CR17","unstructured":"IBM ILOG: CPLEX High-performance mathematical programming engine. http:\/\/www.ibm.com\/software\/integration\/optimization\/cplex\/"},{"key":"5_CR18","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1023\/A:1011977126230","volume":"7","author":"M Krishnamoorthy","year":"2001","unstructured":"Krishnamoorthy, M., Ernst, A.T., Sharaiha, Y.M.: Comparison of algorithms for the degree constrained minimum spanning tree. J. Heuristics 7, 587\u2013611 (2001)","journal-title":"J. Heuristics"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Kruskal, J.B.: On the shortest spanning subtree and the traveling salesman problem. In: Proceedings of the American Mathematical Society, vol. 7, pp. 48\u201350 (1956)","DOI":"10.1090\/S0002-9939-1956-0078686-7"},{"key":"5_CR20","unstructured":"Lozovanu, D., Zelikovsky, A.: Minimal and bounded tree problems. In: Tezele Congresului XVIII al Academiei Romano-Americane, Kishniev, p. 25 (1996). As cited by Ravi et al"},{"key":"5_CR21","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0305-0548(80)90022-2","volume":"7","author":"SC Narula","year":"1980","unstructured":"Narula, S.C., Ho, C.A.: Degree-constrained minimum spanning tree. Comput. Oper. Res. 7, 239\u2013249 (1980)","journal-title":"Comput. Oper. Res."},{"key":"5_CR22","unstructured":"Naveen, G.: Saving an epsilon: a 2-approximation for the k-MST problem in graphs. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, pp. 396\u2013402 (2005)"},{"key":"5_CR23","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"RC Prim","year":"1957","unstructured":"Prim, R.C.: Shortest connection networks and some generalisations. Bell Syst. Tech. J. 36, 1389\u20131401 (1957)","journal-title":"Bell Syst. Tech. J."},{"key":"5_CR24","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1137\/S0895480194266331","volume":"9","author":"R Ravi","year":"1996","unstructured":"Ravi, R., Sundaram, R., Marathe, M., Rosenkrantz, D., Ravi, S.: Spanning trees short or small. SIAM J. Discrete Math. 9, 178\u2013200 (1996)","journal-title":"SIAM J. Discrete Math."},{"key":"5_CR25","doi-asserted-by":"publisher","first-page":"627","DOI":"10.4218\/etrij.08.1308.0099","volume":"30","author":"J Stankovic","year":"2008","unstructured":"Stankovic, J.: When sensor and actuator networks cover the world. ETRI J. 30, 627\u2013633 (2008)","journal-title":"ETRI J."},{"key":"5_CR26","first-page":"301","volume":"7","author":"JK Thenepalle","year":"2018","unstructured":"Thenepalle, J.K., Singamsetty, P.: The degree constrained k-cardinality minimum spanning tree problem a lexisearch algorithm. Decis. Sci. Lett. 7, 301\u2013310 (2018)","journal-title":"Decis. Sci. Lett."},{"key":"5_CR27","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/0377-2217(89)90169-0","volume":"39","author":"A Volgenant","year":"1989","unstructured":"Volgenant, A.: A Lagrangean approach to the degree constrained minimum spanning tree problem. Eur. J. Oper. Res. 39, 325\u2013331 (1989)","journal-title":"Eur. J. Oper. Res."},{"key":"5_CR28","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1007\/s11036-006-7798-5","volume":"11","author":"L Wang","year":"2006","unstructured":"Wang, L., Xiao, Y.: A survey of energy-efficient scheduling mechanisms in sensor networks. Mob. Netw. Appl. 11, 723\u2013740 (2006)","journal-title":"Mob. Netw. Appl."},{"key":"5_CR29","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/s11276-008-0125-2","volume":"16","author":"T Yardibi","year":"2010","unstructured":"Yardibi, T., Karasan, E.: A distributed activity scheduling algorithm for wireless sensor networks with partial coverage. Wirel. Netw. 16, 213\u2013225 (2010)","journal-title":"Wirel. Netw."}],"container-title":["Lecture Notes in Computer Science","Mobile Web and Intelligent Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-97163-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T16:06:33Z","timestamp":1709827593000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-97163-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319971629","9783319971636"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-97163-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"14 July 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MobiWIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Mobile Web and Intelligent Information Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Barcelona","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mobiwis2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.mobiwis.org\/2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}