{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T23:48:06Z","timestamp":1747180086415},"reference-count":12,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/lanman.2005.1541532","type":"proceedings-article","created":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T15:41:15Z","timestamp":1160581275000},"page":"1-6","source":"Crossref","is-referenced-by-count":3,"title":["FATE: A Polynomial Time Framework for Flow Allocation in MPLS-TE Networks"],"prefix":"10.1109","author":[{"given":"S.","family":"Lahoud","sequence":"first","affiliation":[]},{"given":"G.","family":"Texier","sequence":"additional","affiliation":[]},{"given":"L.","family":"Toutain","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"3","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-25551-6_4"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1016\/S1388-3437(03)80192-0"},{"key":"10","article-title":"On selection of paths for multi-path routing","author":"nelakuditi","year":"2001","journal-title":"IWQoS"},{"journal-title":"Routing Flow and Capacity Design in Communication and Computer Networks","year":"2004","author":"pio?ro","key":"1"},{"key":"7","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-45753-4_7","article-title":"Approximation algorithms for the unsplittable flow problem","author":"chakrabarti","year":"2002","journal-title":"5th International Workshop on Approximation Algorithms for Combinatorial Optimization"},{"key":"6","article-title":"A simple polynomial time framework for reduced-path decomposition in multi-path routing","author":"mirrokni","year":"2004","journal-title":"IEEE INFOCOM"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2003.10.001"},{"key":"4","article-title":"A constrained multipath traffic engineering scheme for mpls networks","author":"lee","year":"2002","journal-title":"ICC"},{"journal-title":"Network Flows Theory Algorithms and Applications","year":"1993","author":"ahuja","key":"9"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1287\/opre.34.2.250"},{"journal-title":"\"Open Source (Mixed-integer) Linear Programming System \" Version 5 1 0 0 - GNU LGPL (Lesser General Public Licence)","year":"2004","author":"berkelaar","key":"11"},{"journal-title":"Lexicographically Minimum and Maximum Load Linear Programming Problems","year":"2004","author":"nace","key":"12"}],"event":{"name":"2005 14th IEEE Workshop on Local & Metropolitan Area Networks","location":"Chania, Crete, Greece"},"container-title":["2005 14th IEEE Workshop on Local & Metropolitan Area Networks"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/10349\/32915\/01541532.pdf?arnumber=1541532","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,17]],"date-time":"2017-06-17T10:08:30Z","timestamp":1497694110000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1541532\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/lanman.2005.1541532","relation":{},"subject":[]}}