{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:25:14Z","timestamp":1740122714081,"version":"3.37.3"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,6,26]],"date-time":"2023-06-26T00:00:00Z","timestamp":1687737600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,6,26]],"date-time":"2023-06-26T00:00:00Z","timestamp":1687737600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001871","name":"Fundacao para a Ciencia e a Tecnologia","doi-asserted-by":"crossref","award":["UIDB\/00308\/2020","UIDB\/00308\/2020","UIDB\/00308\/2020"],"award-info":[{"award-number":["UIDB\/00308\/2020","UIDB\/00308\/2020","UIDB\/00308\/2020"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"crossref"}]},{"name":"National Science Foundation","award":["CNS-0916505"],"award-info":[{"award-number":["CNS-0916505"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Netw Syst Manage"],"published-print":{"date-parts":[[2023,7]]},"DOI":"10.1007\/s10922-023-09738-z","type":"journal-article","created":{"date-parts":[[2023,6,26]],"date-time":"2023-06-26T03:10:18Z","timestamp":1687749018000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Two Algorithms for the k-Widest Path Problem"],"prefix":"10.1007","volume":"31","author":[{"given":"Teresa","family":"Gomes","sequence":"first","affiliation":[]},{"given":"L\u00facia","family":"Martins","sequence":"additional","affiliation":[]},{"given":"Jos\u00e9 M. F.","family":"Craveirinha","sequence":"additional","affiliation":[]},{"given":"Deep","family":"Medhi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,26]]},"reference":[{"issue":"12","key":"9738_CR1","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1109\/MCOM.2002.1106166","volume":"40","author":"D Medhi","year":"2002","unstructured":"Medhi, D.: QoS routing computation with path caching: a framework and network performance. IEEE Commun. Mag. 40(12), 106\u2013113 (2002)","journal-title":"IEEE Commun. Mag."},{"issue":"5","key":"9738_CR2","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1287\/opre.8.5.733","volume":"8","author":"M Pollack","year":"1960","unstructured":"Pollack, M.: The maximum capacity through a network. Oper. Res. 8(5), 733\u2013736 (1960). https:\/\/doi.org\/10.1287\/opre.8.5.733","journal-title":"Oper. Res."},{"issue":"6","key":"9738_CR3","doi-asserted-by":"publisher","first-page":"898","DOI":"10.1287\/opre.9.6.898","volume":"9","author":"T Hu","year":"1961","unstructured":"Hu, T.: The maximum capacity route problem. Oper. Res. 9(6), 898\u2013900 (1961)","journal-title":"Oper. Res."},{"issue":"1","key":"9738_CR4","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"JB Kruskal","year":"1956","unstructured":"Kruskal, J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Am. Math. Soc. 7(1), 48\u201350 (1956)","journal-title":"Proc. Am. Math. Soc."},{"key":"9738_CR5","doi-asserted-by":"publisher","first-page":"1228","DOI":"10.1109\/49.536364","volume":"14","author":"Z Wang","year":"1996","unstructured":"Wang, Z., Crowcroft, J.: Quality-of-service routing for supporting multimedia applications. IEEE J. Select. Areas Commun. 14, 1228\u20131234 (1996)","journal-title":"IEEE J. Select. Areas Commun."},{"key":"9738_CR6","doi-asserted-by":"publisher","unstructured":"Taft-Plotkin, N., Bellur, B., Ogier, R.: Quality-of-service routing using maximally disjoint paths. In: Seventh international workshop on quality of service 1999 (IWQoS \u201999), pp. 119\u2013128 (1999). https:\/\/doi.org\/10.1109\/IWQOS.1999.766485","DOI":"10.1109\/IWQOS.1999.766485"},{"key":"9738_CR7","unstructured":"Medhi, D., Ramasamy, K.: Network Routing: Algorithms, Protocols, and Architectures, Second Edition. Morgan Kaufmann Publishers (an imprint of Elsevier), The Netherlands (2017)"},{"key":"9738_CR8","first-page":"1192","volume-title":"Networking 2004","author":"S Siachalou","year":"2004","unstructured":"Siachalou, S., Georgiadis, L.: Precomputation of constrained widest paths in communication networks. In: Editrou, N., Kontovasilis, K., Rouskas, G.N., Iliadis, I., Merakos, L. (eds.) Networking 2004, pp. 1192\u20131203. Springer, Berlin (2004)"},{"key":"9738_CR9","doi-asserted-by":"crossref","unstructured":"Sobrinho, J.L., Ferreira, M.A.: Routing on multiple optimality criteria. In: Proceedings of the annual conference of the ACM special interest group on data communication on the applications, technologies, architectures, and protocols for computer communication (ACM SIGCOMM\u20192020), pp. 211\u2013225 (2020)","DOI":"10.1145\/3387514.3405864"},{"issue":"11","key":"9738_CR10","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1287\/mnsc.17.11.712","volume":"17","author":"JY Yen","year":"1971","unstructured":"Yen, J.Y.: Finding the $$k$$ shortest loopless paths in a network. Manage. Sci. 17(11), 712\u2013716 (1971)","journal-title":"Manage. Sci."},{"key":"9738_CR11","series-title":"International Series in Operations Research & Management Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4939-3094-4_26","volume-title":"Multicriteria Analysis in Telecommunication Network Planning and Design: A Survey","author":"J Cl\u00edmaco","year":"2016","unstructured":"Cl\u00edmaco, J., Craveirinha, J., Gir\u00e3o-Silv, R.: Multiple criteria decision analysis. In: Greco, S., Ehrgott, M., Figueira, J.R. (eds.) Multicriteria Analysis in Telecommunication Network Planning and Design: A Survey. International Series in Operations Research & Management Science, Springer, New York (2016). https:\/\/doi.org\/10.1007\/978-1-4939-3094-4_26"},{"issue":"3","key":"9738_CR12","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1142\/S0129054199000186","volume":"10","author":"E Martins","year":"1999","unstructured":"Martins, E., Pascoal, M., Santos, J.: Deviation algorithms for ranking shortest paths. Int. J. Found. Comput. Sci. 10(3), 247\u2013263 (1999)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"9738_CR13","unstructured":"Martins, E., Pascoal, M., Santos, J.: An algorithm for ranking loopless paths. Technical Report 99\/007, CISUC (1999)"},{"issue":"3","key":"9738_CR14","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1002\/net.20371","volume":"55","author":"S Orlowski","year":"2010","unstructured":"Orlowski, S., Wess\u00e4ly, R., Pi\u00f3ro, M., Tomaszewski, A.: SNDlib 1.0-Survivable Network Design library. Networks 55(3), 276\u2013286 (2010). https:\/\/doi.org\/10.1002\/net.20371","journal-title":"Networks"},{"issue":"2","key":"9738_CR15","first-page":"121","volume":"1","author":"E Martins","year":"2003","unstructured":"Martins, E., Pascoal, M.: A new implementation of Yen\u2019s ranking loopless paths algorithm. 4OR-Q. J. Belgian French Italian Oper. Res. Soc. 1(2), 121\u2013134 (2003)","journal-title":"4OR-Q. J. Belgian French Italian Oper. Res. Soc."},{"key":"9738_CR16","unstructured":"Ogier, R., Bellur, B., Taft-Plotkin, N.: An efficient algorithm for computing shortest and widest maximally disjoint paths. Technical Report ITAD-1616-TR-170, SRI International (November 1998)"},{"key":"9738_CR17","unstructured":"Pascoal, M.: Implementations and empirical comparison for k shortest loopless path algorithms. In: The Ninth DIMACS Implementation Challenge: The Shortest Path Problem (2006)"}],"container-title":["Journal of Network and Systems Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10922-023-09738-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10922-023-09738-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10922-023-09738-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,24]],"date-time":"2023-07-24T19:08:14Z","timestamp":1690225694000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10922-023-09738-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,26]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["9738"],"URL":"https:\/\/doi.org\/10.1007\/s10922-023-09738-z","relation":{},"ISSN":["1064-7570","1573-7705"],"issn-type":[{"type":"print","value":"1064-7570"},{"type":"electronic","value":"1573-7705"}],"subject":[],"published":{"date-parts":[[2023,6,26]]},"assertion":[{"value":"27 November 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 March 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 April 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 June 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"There is no financial interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}}],"article-number":"57"}}