{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T00:04:59Z","timestamp":1648857899420},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,11,20]],"date-time":"2013-11-20T00:00:00Z","timestamp":1384905600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,11]]},"DOI":"10.1007\/s10878-013-9683-z","type":"journal-article","created":{"date-parts":[[2013,11,19]],"date-time":"2013-11-19T11:32:06Z","timestamp":1384860726000},"page":"1077-1094","source":"Crossref","is-referenced-by-count":4,"title":["Strong minimum energy $$2$$ 2 -hop rooted topology for hierarchical wireless sensor networks"],"prefix":"10.1007","volume":"30","author":[{"given":"B. S.","family":"Panda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Pushparaj Shetty","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,11,20]]},"reference":[{"key":"9683_CR1","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1111\/j.1475-3995.1999.tb00176.x","volume":"6","author":"L Alfandari","year":"1999","unstructured":"Alfandari L, Paschos VT (1999) Approximating minimum spanning tree of depth two. Int Trans Oper Res 6:607\u2013622","journal-title":"Int Trans Oper Res"},{"key":"9683_CR2","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.orl.2004.05.005","volume":"33","author":"E Althaus","year":"2005","unstructured":"Althaus E, Funke S, Har-peled S, Ramos EA, Skutella M (2005) Approximating $$k$$ k -hop minimum spanning trees. Oper Res Lett 33:115\u2013120","journal-title":"Oper Res Lett"},{"key":"9683_CR3","doi-asserted-by":"crossref","unstructured":"Alimonti P, Kann V (1997) Hardness of approximating problems on cubic graphs, In: Proceedings of of 3rd Italian conference on algorithms and complexity, Rome, Lecturer notes in computer Science, vol 1203, pp 288\u2013298","DOI":"10.1007\/3-540-62592-5_80"},{"key":"9683_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-58412-1","volume-title":"Complexity and approximation","author":"G Ausiello","year":"1999","unstructured":"Ausiello G, Crescenzi P, Gambosi G, Kann V, Marchetti-Speccamela A, Protasi M (1999) Complexity and approximation. Springer, Berlin"},{"key":"9683_CR5","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.tcs.2008.03.004","volume":"402","author":"D Bil\u00f2","year":"2008","unstructured":"Bil\u00f2 D, Proietti G (2008) On the complexity of minimizing interference in ad-hoc and sensor networks. Theor Comput Sci 402:43\u201355","journal-title":"Theor Comput Sci"},{"key":"9683_CR6","doi-asserted-by":"crossref","unstructured":"Calinescu G (2003) Wan P (2003) Range assignment for high connectivity in wireless adhoc networks, ADHOC-NOW 2003 LNCS, vol 2865, pp 235\u2013246","DOI":"10.1007\/978-3-540-39611-6_21"},{"issue":"3","key":"9683_CR7","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1109\/TMC.2003.1233530","volume":"2","author":"X Cheng","year":"2003","unstructured":"Cheng X, Narahari B, Simha R, Cheng MX, Liu D (2003) Strong minimum energy topology in wireless sensor networks: NP-completeness and heuristics. IEEE Trans Mob Computing 2(3):248\u2013256","journal-title":"IEEE Trans Mob Computing"},{"key":"9683_CR8","doi-asserted-by":"crossref","unstructured":"Clementi AEF, Penna P, Silvestri R (1999) Hardness results for the power range assignment problem in packet radio networks. In: Proceedings of third international workshop on randomization and approximation in computer science (APPROX 1999), LNCS, vol 1671, pp 195\u2013208, Springer, July 1999","DOI":"10.1007\/978-3-540-48413-4_21"},{"key":"9683_CR9","unstructured":"Clementi AEF, Huiban G, Penna P, Rossi G, Verhoeven YC (2002) Some recent theoretical advances and open questions on energy consumption in ad-hoc wireless networks. In: Proceedings of 3rd workshop on approximation and randomization algorithms in communication networks (ARACNE), pp 23\u201338"},{"key":"9683_CR10","doi-asserted-by":"crossref","unstructured":"Estrin D, Govindan R, Heidemann JS, Kumar S (1999) Next century challenges: scalable coordination in sensor networks. In: Mobile computing and networking, Seattle, WA, USA","DOI":"10.1145\/313451.313556"},{"key":"9683_CR11","unstructured":"Fuchs B (2005) On the hardness of range assignment problems. Electronic colloquium on complexity. Report no 113"},{"issue":"2","key":"9683_CR12","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/s10878-005-6858-2","volume":"9","author":"X Jia","year":"2005","unstructured":"Jia X, Kim D, Makki S, Wan PJ, Yi CW (2005) Power assignment for k-connectivity in wireless ad hoc networks. J Comb Optim 9(2):213\u2013222","journal-title":"J Comb Optim"},{"key":"9683_CR13","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1023\/B:MONE.0000048543.95178.f5","volume":"10","author":"EL Lloyd","year":"2005","unstructured":"Lloyd EL, Liu R, Marathe MV, Ramanathan R, Ravi SS (2005) Algorithmic aspects of topology control problems for ad hoc networks. Mob Netw Appl 10:19\u201334","journal-title":"Mob Netw Appl"},{"key":"9683_CR14","doi-asserted-by":"crossref","unstructured":"Nutov Z (2008) Approximating minimum-power k-connectivity. In: Coudert D et al (eds) ADHOC-NOW 2008, LNCS, vol 5198, Springer, Berlin, pp 86\u201393","DOI":"10.1007\/978-3-540-85209-4_7"},{"issue":"5","key":"9683_CR15","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1145\/332833.332838","volume":"43","author":"GJ Pottie","year":"2000","unstructured":"Pottie GJ, Kaiser WJ (2000) Wireless integrated network sensors. Commun ACM 43(5):51\u201358","journal-title":"Commun ACM"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9683-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9683-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9683-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,2]],"date-time":"2019-08-02T15:06:25Z","timestamp":1564758385000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9683-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,20]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,11]]}},"alternative-id":["9683"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9683-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,11,20]]}}}