{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,4]],"date-time":"2025-10-04T14:41:06Z","timestamp":1759588866393},"reference-count":21,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,6,1]],"date-time":"2003-06-01T00:00:00Z","timestamp":1054425600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Networks"],"published-print":{"date-parts":[[2003,6]]},"DOI":"10.1016\/s1389-1286(03)00189-0","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T17:26:08Z","timestamp":1051723568000},"page":"199-210","source":"Crossref","is-referenced-by-count":26,"title":["On the solution of reroute sequence planning problem in MPLS networks"],"prefix":"10.1016","volume":"42","author":[{"given":"Bal\u00e1zs G\u00e1bor","family":"J\u00f3zsa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M\u00e1rton","family":"Makai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1389-1286(03)00189-0_BIB1","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1002\/rsa.3240020403","article-title":"A parallel algorithmic version of the local lemma","volume":"2","author":"Alon","year":"1991","journal-title":"Random Structures & Algorithms"},{"key":"10.1016\/S1389-1286(03)00189-0_BIB2","doi-asserted-by":"crossref","unstructured":"J. Ash, Y. Lee, P. Ashwood-Smith, B. Jamoussi, D. Fedyk, D. Skalecki, L. Li, LSP modification using CR-LDP, Internet Engineering Task Force, Request For Comments (Proposed Standard) 3214, January 2002","DOI":"10.17487\/rfc3214"},{"issue":"12","key":"10.1016\/S1389-1286(03)00189-0_BIB3","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1109\/35.809383","article-title":"MPLS and traffic engineering in IP networks","volume":"37","author":"Awduche","year":"1999","journal-title":"IEEE Communications Magazine"},{"key":"10.1016\/S1389-1286(03)00189-0_BIB4","doi-asserted-by":"crossref","unstructured":"D. Awduche, J. Malcolm, J. Agogbua, M. O\u2019Dell, J. McManus, Requirements for traffic engineering over MPLS, Internet Engineering Task Force, Request For Comments (Proposed Standard) 2702, September 1999","DOI":"10.17487\/rfc2702"},{"key":"10.1016\/S1389-1286(03)00189-0_BIB5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0024-3795(81)90085-9","article-title":"On some combinatorial questions in finite-dimensional spaces","volume":"41","author":"B\u00e1r\u00e1ny","year":"1981","journal-title":"Linear Algebra and its Applications"},{"issue":"3","key":"10.1016\/S1389-1286(03)00189-0_BIB6","first-page":"177","article-title":"T\u00f6bbg\u00e9pes \u00fctemez\u00e9si probl\u00e9m\u00e1k k\u00f6zel optim\u00e1lis megold\u00e1sa","volume":"15","author":"B\u00e1r\u00e1ny","year":"1982","journal-title":"Szigma"},{"key":"10.1016\/S1389-1286(03)00189-0_BIB7","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1002\/rsa.3240020402","article-title":"An algorithmic approach to the Lov\u00e1sz local lemma","volume":"2","author":"Beck","year":"1991","journal-title":"Random Structures & Algorithms"},{"key":"10.1016\/S1389-1286(03)00189-0_BIB8","series-title":"Handbook of Combinatorics","first-page":"1405","article-title":"Discrepancy theory","author":"Beck","year":"1995"},{"key":"10.1016\/S1389-1286(03)00189-0_BIB9","series-title":"Infinite and Finite Sets","first-page":"609","article-title":"Problems and results on 3-chromatic hypergraphs and some related questions","volume":"vol. 11","author":"Erd\u0151s","year":"1975"},{"key":"10.1016\/S1389-1286(03)00189-0_BIB10","first-page":"56","article-title":"O velicine konstanty Steinica","volume":"14\/2","author":"Grinberg","year":"1980","journal-title":"Funkcionalnij Analiz i Prilozen"},{"key":"10.1016\/S1389-1286(03)00189-0_BIB11","series-title":"Approximation Algorithms for NP-hard Problems","year":"1997"},{"key":"10.1016\/S1389-1286(03)00189-0_BIB12","doi-asserted-by":"crossref","first-page":"13","DOI":"10.2307\/2282952","article-title":"Probability inequalities for sums of bounded random variables","volume":"58","author":"Hoeffding","year":"1963","journal-title":"American Statistical Association Journal"},{"key":"10.1016\/S1389-1286(03)00189-0_BIB13","doi-asserted-by":"crossref","unstructured":"B. Jamoussi (Ed.), Constraint-based LSP setup using LDP, Internet Engineering Task Force, Request For Comments (Proposed Standard) 3212, January 2002","DOI":"10.17487\/rfc3212"},{"issue":"3","key":"10.1016\/S1389-1286(03)00189-0_BIB14","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1023\/A:1015318600381","article-title":"An efficient algorithm for global path optimization in MPLS networks","volume":"2","author":"J\u00f3zsa","year":"2001","journal-title":"Optimization and Engineering"},{"key":"10.1016\/S1389-1286(03)00189-0_BIB15","doi-asserted-by":"crossref","unstructured":"B.G. J\u00f3zsa, G. Magyar, Reroute sequence planning for label switched paths in multiprotocol label switching networks, in: IEEE Symposium on Computers and Communications, Hammamet, Tunisia, 2001","DOI":"10.1109\/ISCC.2001.935393"},{"key":"10.1016\/S1389-1286(03)00189-0_BIB16","doi-asserted-by":"crossref","unstructured":"B.G. J\u00f3zsa, Reroute sequence planning for protected traffic flows in GMPLS networks, in: IEEE International Conference on Communications, New York, 2002","DOI":"10.1109\/ICC.2002.997334"},{"key":"10.1016\/S1389-1286(03)00189-0_BIB17","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/0022-0000(88)90003-7","article-title":"Probabilistic construction of deterministic algorithms: approximating packing integer programs","volume":"37","author":"Raghavan","year":"1988","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/S1389-1286(03)00189-0_BIB18","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0166-218X(94)90036-1","article-title":"On some geometric methods in scheduling theory: a survey","volume":"55","author":"Sevastyanov","year":"1994","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S1389-1286(03)00189-0_BIB19","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/0095-8956(77)90057-0","article-title":"Balancing games","volume":"23","author":"Spencer","year":"1977","journal-title":"Journal of Combinatorial Theory Series B"},{"key":"10.1016\/S1389-1286(03)00189-0_BIB20","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/BF02579409","article-title":"Balancing vectors in the max norm","volume":"6","author":"Spencer","year":"1986","journal-title":"Combinatorica"},{"issue":"2","key":"10.1016\/S1389-1286(03)00189-0_BIB21","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1109\/65.826369","article-title":"Traffic engineering with MPLS in the internet","volume":"14","author":"Xiao","year":"2000","journal-title":"IEEE Network"}],"container-title":["Computer Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128603001890?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128603001890?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T04:53:41Z","timestamp":1553662421000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1389128603001890"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,6]]}},"alternative-id":["S1389128603001890"],"URL":"https:\/\/doi.org\/10.1016\/s1389-1286(03)00189-0","relation":{},"ISSN":["1389-1286"],"issn-type":[{"value":"1389-1286","type":"print"}],"subject":[],"published":{"date-parts":[[2003,6]]}}}