{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T23:00:16Z","timestamp":1768777216860,"version":"3.49.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,2,13]],"date-time":"2012-02-13T00:00:00Z","timestamp":1329091200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2013,2]]},"DOI":"10.1007\/s00224-012-9384-5","type":"journal-article","created":{"date-parts":[[2012,2,12]],"date-time":"2012-02-12T01:57:18Z","timestamp":1329011838000},"page":"285-296","source":"Crossref","is-referenced-by-count":17,"title":["Energy-Efficient Communication in Multi-interface Wireless Networks"],"prefix":"10.1007","volume":"52","author":[{"given":"Stavros","family":"Athanassopoulos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ioannis","family":"Caragiannis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christos","family":"Kaklamanis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evi","family":"Papaioannou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,2,13]]},"reference":[{"key":"9384_CR1","first-page":"131","volume-title":"Proceedings of the 23rd Annual ACM Symposium on Theory of Computing (STOC 91)","author":"A. Agrawal","year":"1991","unstructured":"Agrawal, A., Klein, P., Ravi, R.: When trees collide: an approximation algorithm for generalized Steiner tree problem on networks. In: Proceedings of the 23rd Annual ACM Symposium on Theory of Computing (STOC 91), pp. 131\u2013144 (1991)"},{"issue":"5","key":"9384_CR2","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1145\/1039111.1039122","volume":"34","author":"P. Bahl","year":"2004","unstructured":"Bahl, P., Adya, A., Padhye, J., Walman, A.: Reconsidering wireless systems with multiple radios. Comput. Commun. Rev. 34(5), 39\u201346 (2004)","journal-title":"Comput. Commun. Rev."},{"key":"9384_CR3","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1145\/1806689.1806769","volume-title":"Proceedings of the 42nd ACM Symposium on Theory of Computing (STOC 10)","author":"J. Byrka","year":"2010","unstructured":"Byrka, J., Grandoni, F., Rothvoss, T., Sanit\u00e0, L.: An improved LP-based approximation for Steiner tree. In: Proceedings of the 42nd ACM Symposium on Theory of Computing (STOC 10), pp. 583\u2013592 (2010)"},{"key":"9384_CR4","series-title":"LNCS","first-page":"114","volume-title":"Proceedings of the 11th Annual European Symposium on Algorithms (ESA\u201903)","author":"G. C\u01celinescu","year":"2003","unstructured":"C\u01celinescu, G., Kapoor, S., Olshevsky, A., Zelikovsky, A.: Network lifetime and power assignment in ad-hoc wireless networks. In: Proceedings of the 11th Annual European Symposium on Algorithms (ESA\u201903). LNCS, vol.\u00a02832, pp. 114\u2013126. Springer, Berlin (2003)"},{"issue":"5","key":"9384_CR5","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1007\/s00224-005-1204-8","volume":"39","author":"I. Caragiannis","year":"2006","unstructured":"Caragiannis, I., Kaklamanis, C., Kanellopoulos, P.: Energy-efficient wireless network design. Theory Comput. Syst. 39(5), 593\u2013617 (2006)","journal-title":"Theory Comput. Syst."},{"key":"9384_CR6","doi-asserted-by":"crossref","first-page":"1322","DOI":"10.1109\/PIMRC.2005.1651655","volume-title":"Proceedings of the IEEE 16th International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC 05)","author":"D. Cavalcanti","year":"2005","unstructured":"Cavalcanti, D., Gossain, H., Agrawal, D.: Connectivity in multi-radio, multi-channel heterogeneous ad hoc networks. In: Proceedings of the IEEE 16th International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC 05), pp. 1322\u20131326. IEEE Press, New York (2005)"},{"key":"9384_CR7","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1007\/978-3-642-17461-2_21","volume-title":"Proceedings of the 4th International Conference on Combinatorial Optimization and Applications (COCOA 10)","author":"G. D\u2019Angelo","year":"2010","unstructured":"D\u2019Angelo, G., Di Stefano, G., Navarra, A.: Minimizing the maximum duty for connectivity in multi-interface networks. In: Proceedings of the 4th International Conference on Combinatorial Optimization and Applications (COCOA 10). LNCS, vol.\u00a06509, pp. 254\u2013267. Springer, Berlin (2010)"},{"key":"9384_CR8","series-title":"LNCS","first-page":"190","volume-title":"Proceedings of the 37th Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 11)","author":"G. D\u2019Angelo","year":"2011","unstructured":"D\u2019Angelo, G., Di Stefano, G., Navarra, A.: Min-max coverage in multi-interface networks. In: Proceedings of the 37th Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 11). LNCS, vol.\u00a06543, pp. 190\u2013201. Springer, Berlin (2011)"},{"key":"9384_CR9","series-title":"LNCS","first-page":"202","volume-title":"Proceedings of the 37th Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 11)","author":"G. D\u2019Angelo","year":"2011","unstructured":"D\u2019Angelo, G., Di Stefano, G., Navarra, A.: Bandwidth constrained multi-interface networks. In: Proceedings of the 37th Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 11). LNCS, vol.\u00a06543, pp. 202\u2013213. Springer, Berlin (2011)"},{"key":"9384_CR10","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/1023720.1023732","volume-title":"Proceedings of the 10th Annual International Conference on Mobile Computing and Networking (MobiCom\u00a004)","author":"R. Draves","year":"2004","unstructured":"Draves, R., Padhye, J., Zill, B.: Routing in multi-radio, multi-hop wireless mesh networks. In: Proceedings of the 10th Annual International Conference on Mobile Computing and Networking (MobiCom\u00a004), pp. 114\u2013128. ACM, New York (2004)"},{"issue":"4","key":"9384_CR11","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige, U.: A threshold of lnn for approximating set cover. J. ACM 45(4), 634\u2013652 (1998)","journal-title":"J. ACM"},{"key":"9384_CR12","volume-title":"Proceedings of the IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC 08)","author":"A. Farag\u00f3","year":"2008","unstructured":"Farag\u00f3, A., Basagni, S.: The effect of multi-radio nodes on network connectivity: a graph theoretic analysis. In: Proceedings of the IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC 08). IEEE Press, New York (2008), 5 pages"},{"key":"9384_CR13","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1137\/S0097539793242618","volume":"24","author":"M.X. Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: A\u00a0general approximation technique for constrained forest problems. SIAM J. Comput. 24, 296\u2013317 (1995)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"9384_CR14","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1006\/inco.1998.2754","volume":"150","author":"S. Guha","year":"1999","unstructured":"Guha, S., Khuller, S.: Improved methods for approximating node weighted Steiner trees and connected dominating sets. Inf. Comput. 150(1), 57\u201374 (1999)","journal-title":"Inf. Comput."},{"issue":"3","key":"9384_CR15","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1002\/net.20266","volume":"53","author":"R. Klasing","year":"2009","unstructured":"Klasing, R., Kosowski, A., Navarra, A.: Cost minimisation in wireless networks with bounded and unbounded number of interfaces. Networks 53(3), 266\u2013275 (2009)","journal-title":"Networks"},{"issue":"4","key":"9384_CR16","doi-asserted-by":"crossref","first-page":"1063","DOI":"10.1007\/s11276-009-0188-8","volume":"16","author":"A. Kosowski","year":"2010","unstructured":"Kosowski, A., Navarra, A., Pinotti, M.C.: Exploiting multi-interface networks: connectivity and cheapest paths. Wirel. Netw. 16(4), 1063\u20131073 (2010)","journal-title":"Wirel. Netw."},{"key":"9384_CR17","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1006\/jagm.2000.1086","volume":"36","author":"H.J. Pr\u00f6mel","year":"2000","unstructured":"Pr\u00f6mel, H.J., Steger, A.: A new approximation algorithm for the Steiner tree problem with performance ratio\u00a05\/3. J. Algorithms 36, 89\u2013101 (2000)","journal-title":"J. Algorithms"},{"key":"9384_CR18","first-page":"475","volume-title":"Proceedings of the 29th Annual ACM Symposium on the Theory of Computing (STOC 97)","author":"R. Raz","year":"1997","unstructured":"Raz, R., Safra, S.: A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. In: Proceedings of the 29th Annual ACM Symposium on the Theory of Computing (STOC 97), pp. 475\u2013484 (1997)"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-012-9384-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-012-9384-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-012-9384-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T07:54:23Z","timestamp":1558684463000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-012-9384-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2,13]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,2]]}},"alternative-id":["9384"],"URL":"https:\/\/doi.org\/10.1007\/s00224-012-9384-5","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,2,13]]}}}