{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T21:30:14Z","timestamp":1694640614274},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2005,9,1]],"date-time":"2005-09-01T00:00:00Z","timestamp":1125532800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2005,9]]},"DOI":"10.1007\/s10878-005-2263-0","type":"journal-article","created":{"date-parts":[[2005,8,25]],"date-time":"2005-08-25T09:56:35Z","timestamp":1124963795000},"page":"99-111","source":"Crossref","is-referenced-by-count":5,"title":["Maximizing Profits of Routing in WDM Networks"],"prefix":"10.1007","volume":"10","author":[{"given":"Jianping","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kang","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lusheng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hao","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2263_CR1","doi-asserted-by":"crossref","unstructured":"U. Adamy, C. Ambuehl, R.S. Anand, and T. Erlebach, \u201cCall control in rings,\u201d in Proceedings of the 29th International Colloquium on Automata, Languages, and Programming (ICALP 2002), LNCS 2380, Springer-Verlag, 2002, pp. 788\u2013799.","DOI":"10.1007\/3-540-45465-9_67"},{"issue":"3","key":"2263_CR2","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0166-218X(95)80003-M","volume":"59","author":"M.C. Carlisle","year":"1995","unstructured":"M.C. Carlisle and E.L. Lloyd, \u201cOn the k-coloring of intervals,\u201d Discrete Applied Mathematics, vol. 59, no 3, pp. 225\u2013235, 1995.","journal-title":"Discrete Applied Mathematics"},{"key":"2263_CR3","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J. Edmonds","year":"1972","unstructured":"J. Edmonds and R.M. Karp, \u201cTheoretical improvements in algorithmic efficiency for network flow problems,\u201d Journal of Association for Computing Machinery, vol. 19, pp. 248\u2013264, 1972.","journal-title":"Journal of Association for Computing Machinery"},{"key":"2263_CR4","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman, San Francisco, 1979."},{"key":"2263_CR5","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1002\/bltj.2047","volume":"2","author":"S. Khanna","year":"1997","unstructured":"S. Khanna, \u201cA polynomial time approximation scheme for the SONET ring loading problem,\u201d Bell Labs Tech. J., vol. 2, pp. 36\u201341, 1997.","journal-title":"Bell Labs Tech. J"},{"key":"2263_CR6","doi-asserted-by":"crossref","unstructured":"C. Nomikos, A. Pagourtzis, and S. Zachos, \u201cMinimizing request blocking in all-optical rings,\u201d in Proceedings of IEEE INFOCOM, San Francisco, CA, USA, 2003, pp. 1355\u20131361.","DOI":"10.1109\/INFCOM.2003.1208971"},{"key":"2263_CR7","doi-asserted-by":"crossref","unstructured":"P. Raghavan and E. Upfal, \u201cEfficient routing in all-optical networks,\u201d in Proceedings of the 26th Annual ACM Symposium on the Theory of Computing, 1994, pp. 134\u2013143.","DOI":"10.1145\/195058.195119"},{"key":"2263_CR8","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A. Schrijver","year":"2003","unstructured":"A. Schrijver, Combinatorial Optimization: Polyhedra and Efficiency, Springer: The Netherlands, 2003."},{"issue":"1","key":"2263_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/S0895480195294994","volume":"11","author":"A. Schrijver","year":"1998","unstructured":"A. Schrijver, P. Seymour, and P. Winkler, \u201cThe ring loading problem,\u201d Siam Journal on Discrete Mathematics, vol. 11, no. 1, pp. 1\u201314, 1998.","journal-title":"Siam Journal on Discrete Mathematics"},{"key":"2263_CR10","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970265","volume-title":"Data Structures and Network Algorithms","author":"R. Tarjan","year":"1983","unstructured":"R. Tarjan, Data Structures and Network Algorithms, SIAM, Philadelphia, PA, 1983."},{"key":"2263_CR11","doi-asserted-by":"crossref","unstructured":"P. Wan and L. Liu, \u201cMaximal throughput in wavelength-routed optimal networks,\u201d in P. Wan, D. Du and P. Pardalos (eds.), DIMACS Series in Discrete Mathematics and Theoretical Computer Science vol. 46: Multichannel Optimal Networks\u2014Theory and Practice, 1998, pp. 15\u201326.","DOI":"10.1090\/dimacs\/046\/02"},{"key":"2263_CR12","unstructured":"G. Wilfong and P. Winkler, \u201cRing routing and wavelength translation,\u201d in Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201998), San Francisco, California, 1998, pp. 333\u2013341."}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-005-2263-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-005-2263-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-005-2263-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T06:13:38Z","timestamp":1586412818000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-005-2263-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,9]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2005,9]]}},"alternative-id":["2263"],"URL":"https:\/\/doi.org\/10.1007\/s10878-005-2263-0","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,9]]}}}