{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:46:49Z","timestamp":1725565609536},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540219590"},{"type":"electronic","value":"9783540246930"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24693-0_98","type":"book-chapter","created":{"date-parts":[[2010,9,11]],"date-time":"2010-09-11T02:02:45Z","timestamp":1284170565000},"page":"1192-1203","source":"Crossref","is-referenced-by-count":0,"title":["Precomputation of Constrained Widest Paths in Communication Networks"],"prefix":"10.1007","author":[{"given":"Stavroula","family":"Siachalou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leonidas","family":"Georgiadis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"98_CR1","volume-title":"Graphs","author":"C Berge","year":"1991","unstructured":"Claude Berge, Graphs, North-Holland Mathematical Library, 1991."},{"key":"98_CR2","volume-title":"An Approximation Algorithm for Combinatorial Optimization Problems with Two Parameters","author":"D Blokh","year":"1995","unstructured":"D. Blokh, G. Gutin, \u201dAn Approximation Algorithm for Combinatorial Optimization Problems with Two Parameters\u201d, IMADA preprint PP-1995\u201314, May 1995."},{"key":"98_CR3","volume-title":"Multi-Objective Optimization using Evolutionary Algorithms","author":"K Deb","year":"2001","unstructured":"K. Deb, Multi-Objective Optimization using Evolutionary Algorithms, Wiley, 2001."},{"key":"98_CR4","first-page":"874","volume-title":"Proc. of IEEE International Conference on Communications","author":"S Chen","year":"1998","unstructured":"S. Chen, K. Nahrstedt, \u201dOn Finding Multi-Constrained Paths\u201d, in Proc. of IEEE International Conference on Communications (ICC\u201998), pp. 874\u2013879, Atlanta, GA, June 1998."},{"key":"98_CR5","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"1990","unstructured":"T. H. Cormen, C. E. Leiserson, R. L. Rivest, Introduction to Algorithms, Mc Graw Hill, 1990."},{"key":"98_CR6","volume-title":"Precomputation for Multi-Constrained QoS Routing in High Speed Networks","author":"Y Cui","year":"2003","unstructured":"Yong Cui, Ke Xu, Jianping Wu, \u201dPrecomputation for Multi-Constrained QoS Routing in High Speed Networks\u201d, IEEE INFOCOM 2003."},{"key":"98_CR7","unstructured":"L. Georgiadis, \u201dBottleneck Multicast Trees in Linear Time\u201d, to be published in IEEE Communications Letters."},{"key":"98_CR8","volume-title":"Computing Shortest Paths for Any Number of Hops","author":"R Guerin","year":"2002","unstructured":"R. Guerin, A. Orda, \u201cComputing Shortest Paths for Any Number of Hops\u201d, IEEE\/ACM Transactions on Networking, vol. 10, no. 5, October 2002."},{"key":"98_CR9","volume-title":"QoS Routing Mechanisms and OSPF Extensions","author":"R Guerin","year":"1997","unstructured":"R. Guerin, A. Orda and Williams D., \u201cQoS Routing Mechanisms and OSPF Extensions\u201d, 2nd IEEE Global Internet Mini-Conference, Phoenix, AZ, November 1997."},{"issue":"3","key":"98_CR10","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/S0140-3664(01)00358-9","volume":"25","author":"T Korkmaz","year":"2002","unstructured":"T. Korkmaz, M. Krunz and S. Tragoudas, \u201dAn Efficient Algorithm for Finding a Path Subject to Two Additive Constraints\u201d, Computer Communications Journal, vol. 25, no. 3, pp. 225\u2013238, Feb. 2002.","journal-title":"Computer Communications Journal"},{"key":"98_CR11","volume-title":"Leda:A Platform for Combinatorial and Geometric Computing","author":"K Mehlhorn","year":"2000","unstructured":"K. Mehlhorn, S. Naher, Leda:A Platform for Combinatorial and Geometric Computing, Cambridge University Press, 2000."},{"issue":"3\u20134","key":"98_CR12","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1016\/S1389-1286(01)00222-5","volume":"37","author":"P Mieghem Van","year":"2001","unstructured":"P. Van Mieghem, H. De Neve and F.A. Kuipers, \u201cHop-by-hop Quality of Service Routing\u201d, Computer Networks, vol. 37\/3\u20134, pp. 407\u2013423, November 2001.","journal-title":"Computer Networks"},{"key":"98_CR13","volume-title":"New Dynamic Algorithms for Shortest Path Tree Computation","author":"P Narvaez","year":"2000","unstructured":"P. Narvaez, Kai-Yeung Siu, and Hong-Yi Tzeng, \u201cNew Dynamic Algorithms for Shortest Path Tree Computation\u201c, IEEE\/A CM Transactions on Networking, vol. 8, no. 6, December 2000."},{"key":"98_CR14","first-page":"128","volume":"1","author":"A Orda","year":"2000","unstructured":"A. Orda and A. Sprintson, \u201cQoS Routing: The Precomputation Perspective\u201d, IEEE INFOCOM 2000, vol. 1, pp. 128\u2013136, 2000.","journal-title":"IEEE INFOCOM 2000"},{"key":"98_CR15","volume-title":"Algebra and Algorithms for QoS Path Computation and Hop-by-Hop Routing in the Internet","author":"JL Sobrino","year":"2001","unstructured":"J. L. Sobrino, \u201cAlgebra and Algorithms for QoS Path Computation and Hop-by-Hop Routing in the Internet\u201d, IEEE INFOCOM 2001, Anchorage, Alaska, April 22\u201326, 2001."},{"key":"98_CR16","volume-title":"A Scalable Approach to the Partition of QoS Requirements in Unicast and Multicast","author":"A Orda","year":"2002","unstructured":"A. Orda and A. Sprintson, \u201cA Scalable Approach to the Partition of QoS Requirements in Unicast and Multicast\u201d, IEEE INFOCOM 2002."},{"issue":"3","key":"98_CR17","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1016\/S1389-1286(03)00286-X","volume":"43","author":"S Siachalou","year":"2003","unstructured":"S. Siachalou, L. Georgiadis, \u201cEfficient QoS Routing\u201d, Computer Networks Journal,vol.43\/3, pp 351\u2013367, October 2003.","journal-title":"Computer Networks Journal"},{"key":"98_CR18","unstructured":"The Power Law Simulator, \n                    http:\/\/www.cs.bu.edu\n                    \n                  \/brite."},{"key":"98_CR19","unstructured":"The Real Networks, \n                    http:\/\/moat.nlanr.net\n                    \n                  \/Routing\/raw-data."},{"key":"98_CR20","unstructured":"http:\/\/genesis.ee.auth.gr\n                    \n                  \/georgiadis\/english\/public\/networking04full.pdf"}],"container-title":["Lecture Notes in Computer Science","NETWORKING 2004. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24693-0_98.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:04:29Z","timestamp":1620011069000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24693-0_98"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540219590","9783540246930"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24693-0_98","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}