{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:45:55Z","timestamp":1725565555248},"publisher-location":"Berlin, Heidelberg","reference-count":11,"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_97","type":"book-chapter","created":{"date-parts":[[2010,9,11]],"date-time":"2010-09-11T02:02:45Z","timestamp":1284170565000},"page":"1180-1191","source":"Crossref","is-referenced-by-count":4,"title":["On the Representability of Arbitrary Path Sets as Shortest Paths: Theory, Algorithms, and Complexity"],"prefix":"10.1007","author":[{"given":"G\u00e1bor","family":"R\u00e9tv\u00e1ri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R\u00f3bert","family":"Szab\u00f3","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00f3zsef J.","family":"B\u00edr\u00f3","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"97_CR1","doi-asserted-by":"crossref","DOI":"10.17487\/rfc3272","volume-title":"Overview and principles of Internet traffic engineering","author":"D Awduche","year":"2002","unstructured":"D. Awduche, A. Chiu, A. Elwalid, I. Widjaja, and X. Xiao, \u201cOverview and principles of Internet traffic engineering.\u201d RFC 3272, May 2002."},{"key":"97_CR2","volume-title":"OSPF Version 2","author":"J Moy","year":"1998","unstructured":"J. Moy, \u201cOSPF Version 2.\u201d RFC 2328, April 1998."},{"key":"97_CR3","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1109\/MCOM.2002.1039866","volume":"40","author":"B Fortz","year":"2002","unstructured":"B. Fortz, J. Rexford, and M. Thorup, \u201cTraffic engineering with traditional IP routing protocols,\u201d IEEE Communications Magazine, vol. 40, pp. 118\u2013124, Oct 2002.","journal-title":"IEEE Communications Magazine"},{"key":"97_CR4","doi-asserted-by":"publisher","first-page":"756","DOI":"10.1109\/JSAC.2002.1003042","volume":"20","author":"B Fortz","year":"2002","unstructured":"B. Fortz and M. Thorup, \u201cOptimizing OSPF\/IS-IS weights in a changing world,\u201d IEEE Journal of Selected Areas in Communications, vol. 20, pp. 756\u2013767, May 2002.","journal-title":"IEEE Journal of Selected Areas in Communications"},{"key":"97_CR5","volume-title":"Increasing internet capacity using local search","author":"B Fortz","year":"2000","unstructured":"B. Fortz and M. Thorup, \u201cIncreasing internet capacity using local search,\u201d 2000. unpublished manuscript, http:\/\/www.research.att.com \/~mthorup\/PAPERS\/or_ospf.ps."},{"key":"97_CR6","volume-title":"Proceedings of INFOCOM 2001","author":"Z Wang","year":"2001","unstructured":"Z. Wang, Y. Wang, and L. Zhang, \u201cInternet traffic engineering without full-mesh overlaying,\u201d in Proceedings of INFOCOM 2001, April 2001."},{"key":"97_CR7","volume-title":"Proceedings of INFOCOM 2003","author":"A Sridharan","year":"2003","unstructured":"A. Sridharan, C. Diot, and R. Gu\u00e9rin, \u201cAchieving near-optimal traffic engineering solutions for current OSPF\/IS-IS networks,\u201d in Proceedings of INFOCOM 2003, March 2003."},{"key":"97_CR8","volume-title":"Avoiding ties in shortest path first routing","author":"M Thorup","year":"2001","unstructured":"M. Thorup, \u201cAvoiding ties in shortest path first routing,\u201d 2001. unpublished manuscript, http:\/\/www.research.att.com \/~mthorup\/PAPERS\/ties_ospf.ps."},{"key":"97_CR9","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"RK Ahuja","year":"1993","unstructured":"R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs, NJ, 1993."},{"key":"97_CR10","volume-title":"Linear Programming and Network Flows","author":"MS Bazaraa","year":"1990","unstructured":"M. S. Bazaraa, J. J. Jarvis, and H. D. Sherali, Linear Programming and Network Flows. John Wiley & Sons, January 1990."},{"key":"97_CR11","volume-title":"BRITE: Universal topology generation from a user\u2019s perspective","author":"A Medina","year":"2001","unstructured":"A. Medina, A. Lakhina, I. Matta, and J. Byers, \u201cBRITE: Universal topology generation from a user\u2019s perspective,\u201d Tech. Rep. 2001\u2013003, 1 2001."}],"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_97.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,30]],"date-time":"2024-03-30T08:37:57Z","timestamp":1711787877000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24693-0_97"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540219590","9783540246930"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24693-0_97","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}