{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T02:31:37Z","timestamp":1771036297501,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2011,6,7]],"date-time":"2011-06-07T00:00:00Z","timestamp":1307404800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1007\/s00453-011-9531-4","type":"journal-article","created":{"date-parts":[[2011,6,6]],"date-time":"2011-06-06T13:14:45Z","timestamp":1307366085000},"page":"274-295","source":"Crossref","is-referenced-by-count":20,"title":["Minimize the Maximum Duty in Multi-interface Networks"],"prefix":"10.1007","volume":"63","author":[{"given":"Gianlorenzo","family":"D\u2019Angelo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gabriele","family":"Di Stefano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alfredo","family":"Navarra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,6,7]]},"reference":[{"issue":"2","key":"9531_CR1","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1145\/1150334.1150336","volume":"2","author":"N. Alon","year":"2006","unstructured":"Alon, N., Moshkovitz, D., Safra, S.: Algorithmic construction of sets for k-restrictions. ACM Trans. Algorithms 2(2), 153\u2013177 (2006)","journal-title":"ACM Trans. Algorithms"},{"issue":"1\u20133","key":"9531_CR2","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0012-365X(92)90678-9","volume":"108","author":"L.D. Andersen","year":"1992","unstructured":"Andersen, L.D.: The strong chromatic index of a cubic graph is at most 10. Discrete Math. 108(1\u20133), 231\u2013252 (1992)","journal-title":"Discrete Math."},{"key":"9531_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1007\/978-3-642-03816-7_10","volume-title":"Proc. of the 34th Int. Symp. on Mathematical Foundations of Computer Science (MFCS)","author":"S. Athanassopoulos","year":"2009","unstructured":"Athanassopoulos, S., Caragiannis, I., Kaklamanis, C., Papaioannou, E.: Energy-efficient communication in multi-interface wireless networks. In: Proc. of the 34th Int. Symp. on Mathematical Foundations of Computer Science (MFCS). Lecture Notes in Computer Science, vol. 5743, pp. 102\u2013111. Springer, Berlin (2009)"},{"issue":"5","key":"9531_CR4","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":"9531_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/978-3-642-10383-4","volume-title":"Proc. of the 10th Int. Conf. on Distributed Computing and Networking (ICDCN)","author":"F. Barsi","year":"2009","unstructured":"Barsi, F., Navarra, A., Pinotti, M.C.: Cheapest paths in multi-interface networks. In: Proc. of the 10th Int. Conf. on Distributed Computing and Networking (ICDCN). Lecture Notes in Computer Science, vol. 5408, pp. 37\u201342. Springer, Berlin (2009)"},{"key":"9531_CR6","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1109\/RWS.2009.4957392","volume-title":"Proc. of the IEEE Radio and Wireless Symposium (RWS)","author":"S. Basagni","year":"2009","unstructured":"Basagni, S., Nidito, F., Farago, A.: The multi-radio advantage. In: Proc. of the IEEE Radio and Wireless Symposium (RWS), pp. 478\u2013481. IEEE, New York (2009)"},{"issue":"6","key":"9531_CR7","doi-asserted-by":"crossref","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"H.L. Bodlaender","year":"1996","unstructured":"Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25(6), 1305\u20131317 (1996)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"9531_CR8","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1007\/s11786-007-0023-5","volume":"1","author":"F. Bruera","year":"2008","unstructured":"Bruera, F., Cicerone, S., D\u2019Angelo, G., Di Stefano, G., Frigioni, D.: Dynamic multi-level overlay graphs for shortest paths. Math. Comput. Sci. 1(4), 709\u2013736 (2008)","journal-title":"Math. Comput. Sci."},{"key":"9531_CR9","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1145\/1216993.1217002","volume-title":"Proc. of the 6th Int. Workshop on Software and Performance (WOSP)","author":"M. Caporuscio","year":"2007","unstructured":"Caporuscio, M., Charlet, D., Issarny, V., Navarra, A.: Energetic performance of service-oriented multi-radio networks: issues and perspectives. In: Proc. of the 6th Int. Workshop on Software and Performance (WOSP), pp. 42\u201345. ACM Press, New York (2007)"},{"key":"9531_CR10","doi-asserted-by":"crossref","first-page":"1322","DOI":"10.1109\/PIMRC.2005.1651655","volume-title":"IEEE 16th Int. Symp. on Personal, Indoor and Mobile Radio Communications (PIMRC)","author":"D. Cavalcanti","year":"2005","unstructured":"Cavalcanti, D., Gossain, H., Agrawal, D.: Connectivity in multi-radio, multi-channel heterogeneous ad hoc networks. In: IEEE 16th Int. Symp. on Personal, Indoor and Mobile Radio Communications (PIMRC), pp. 1322\u20131326. IEEE, New York (2005)"},{"issue":"2","key":"9531_CR11","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0304-3975(91)90020-3","volume":"86","author":"M. Chrobak","year":"1991","unstructured":"Chrobak, M., Eppstein, D.: Planar orientations with low out-degree and compaction of adjacency matrices. Theor. Comput. Sci. 86(2), 243\u2013266 (1991)","journal-title":"Theor. Comput. Sci."},{"key":"9531_CR12","series-title":"Lecture Notes in Computer Science, Part II","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1007\/978-3-642-17461-2_21","volume-title":"Proc. of the 4th Annual International Conference on Combinatorial Optimization and Applications (COCOA)","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: Proc. of the 4th Annual International Conference on Combinatorial Optimization and Applications (COCOA). Lecture Notes in Computer Science, Part II, vol. 6509, pp. 254\u2013267. Springer, Berlin (2010)"},{"key":"9531_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1007\/978-3-642-18381-2_17","volume-title":"Proc. of the 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM)","author":"G. D\u2019Angelo","year":"2011","unstructured":"D\u2019Angelo, G., Di Stefano, G., Navarra, A.: Bandwidth constrained multi-interface networks. In: Proc. of the 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM). Lecture Notes in Computer Science, vol. 6543, pp. 202\u2013213. Springer, Berlin (2011)"},{"key":"9531_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1007\/978-3-642-18381-2_16","volume-title":"Proc. of the 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM)","author":"G. D\u2019Angelo","year":"2011","unstructured":"D\u2019Angelo, G., Di Stefano, G., Navarra, A.: Min-max coverage in multi-interface networks. In: Proc. of the 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM). Lecture Notes in Computer Science, vol. 6543, pp. 190\u2013201. Springer, Berlin (2011)"},{"key":"9531_CR15","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/1023720.1023732","volume-title":"Proc. of the 10th Annual International Conference on Mobile Computing and Networking (MobiCom)","author":"R. Draves","year":"2004","unstructured":"Draves, R., Padhye, J., Zill, B.: Routing in multi-radio, multi-hop wireless mesh networks. In: Proc. of the 10th Annual International Conference on Mobile Computing and Networking (MobiCom), pp. 114\u2013128. ACM, New York (2004)"},{"key":"9531_CR16","volume-title":"Proc. of the IEEE Int. Workshop on Wireless Distributed Networks (WDM).","author":"A. Farag\u00f3","year":"2008","unstructured":"Farag\u00f3, A., Basagni, S.: The effect of multi-radio nodes on network connectivity\u2014a\u00a0graph theoretic analysis. In: Proc. of the IEEE Int. Workshop on Wireless Distributed Networks (WDM). IEEE, New York (2008)"},{"issue":"3","key":"9531_CR17","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1007\/PL00009224","volume":"22","author":"D. Frigioni","year":"1998","unstructured":"Frigioni, D., Marchetti-Spaccamela, A., Nanni, U.: Semidynamic algorithms for maintaining single-source shortest path trees. Algorithmica 22(3), 250\u2013274 (1998)","journal-title":"Algorithmica"},{"key":"9531_CR18","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1007\/BF01758774","volume":"7","author":"H. Gabow","year":"1992","unstructured":"Gabow, H., Westermann, H.: Forests, frames, and games: algorithms for matroid sums and applications. Algorithmica 7, 465\u2013497 (1992)","journal-title":"Algorithmica"},{"key":"9531_CR19","volume-title":"Computers and Intractability, A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness. Freeman, New York (1979)"},{"key":"9531_CR20","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"D.S. Johnson","year":"1974","unstructured":"Johnson, D.S.: Approximation algorithms for combinatorial problems. J. Comput. Syst. Sci. 9, 256\u2013278 (1974)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"9531_CR21","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 minimization in wireless networks with a bounded and unbounded number of interfaces. Networks 53(3), 266\u2013275 (2009)","journal-title":"Networks"},{"issue":"4","key":"9531_CR22","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."},{"issue":"1","key":"9531_CR23","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1006\/jagm.1994.1028","volume":"17","author":"S.M. Malitz","year":"1994","unstructured":"Malitz, S.M.: Genus g graphs have pagenumber $O(\\sqrt{g})$ . J. Algorithms 17(1), 85\u2013109 (1994)","journal-title":"J. Algorithms"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-011-9531-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-011-9531-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-011-9531-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:45:07Z","timestamp":1559123107000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-011-9531-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,7]]},"references-count":23,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2012,6]]}},"alternative-id":["9531"],"URL":"https:\/\/doi.org\/10.1007\/s00453-011-9531-4","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6,7]]}}}