{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:49:37Z","timestamp":1725511777611},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540709176"},{"type":"electronic","value":"9783540709183"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70918-3_6","type":"book-chapter","created":{"date-parts":[[2007,5,23]],"date-time":"2007-05-23T23:41:23Z","timestamp":1179963683000},"page":"61-72","source":"Crossref","is-referenced-by-count":4,"title":["Wavelength Management in WDM Rings to Maximize the Number of Connections"],"prefix":"10.1007","author":[{"given":"Ioannis","family":"Caragiannis","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"6_CR1","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s00453-001-0039-1","volume":"31","author":"B. Awerbuch","year":"2001","unstructured":"Awerbuch, B., et al.: Online competitive algorithms for call admission in optical networks. Algorithmica\u00a031(1), 29\u201343 (2001)","journal-title":"Algorithmica"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"732","DOI":"10.1007\/3-540-48224-5_60","volume-title":"Automata, Languages and Programming","author":"I. Caragiannis","year":"2001","unstructured":"Caragiannis, I., et al.: Fractional path coloring with applications to WDM networks. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 732\u2013743. Springer, Heidelberg (2001)"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1007\/978-3-540-24749-4_23","volume-title":"STACS 2004","author":"I. Caragiannis","year":"2004","unstructured":"Caragiannis, I., Kaklamanis, C.: Approximate path coloring with applications to wavelength routing in WDM optical networks. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol.\u00a02996, pp. 258\u2013269. Springer, Heidelberg (2004)"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0166-218X(93)E0174-W","volume":"59","author":"M.C. Carlisle","year":"1995","unstructured":"Carlisle, M.C., Lloyd, E.L.: On the k-coloring of intervals. Discrete Applied Mathematics\u00a059, 225\u2013235 (1995)","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"6_CR5","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1137\/S0895480101386723","volume":"17","author":"C.T. Cheng","year":"2004","unstructured":"Cheng, C.T.: Improved approximation algorithms for the demand routing and slotting problem with unit demands on rings. SIAM Journal on Discrete Mathematics\u00a017(3), 384\u2013402 (2004)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"3","key":"6_CR6","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1137\/S0895480199361259","volume":"14","author":"T. Erlebach","year":"2001","unstructured":"Erlebach, T., Jansen, K.: The maximum edge-disjoint paths problem in bidirected trees. SIAM Journal on Discrete Mathematics\u00a014(3), 326\u2013366 (2001)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"1-2","key":"6_CR7","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/S0304-3975(99)00152-8","volume":"255","author":"T. Erlebach","year":"2001","unstructured":"Erlebach, T., Jansen, K.: The complexity of path coloring and call scheduling. Theoretical Computer Science\u00a0255(1-2), 33\u201350 (2001)","journal-title":"Theoretical Computer Science"},{"issue":"1-2","key":"6_CR8","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/S0304-3975(99)00029-8","volume":"221","author":"T. Erlebach","year":"1999","unstructured":"Erlebach, T., et al.: Optimal wavelength routing on directed fiber trees. Theoretical Computer Science\u00a0221(1-2), 119\u2013137 (1999)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"6_CR9","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. Journal of the ACM\u00a045(4), 634\u2013652 (1998)","journal-title":"Journal of the ACM"},{"issue":"2","key":"6_CR10","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1137\/0601025","volume":"1","author":"M.R. Garey","year":"1980","unstructured":"Garey, M.R., et al.: The complexity of coloring circular arcs and chords. SIAM Journal on Alg. Disc. Math.\u00a01(2), 216\u2013227 (1980)","journal-title":"SIAM Journal on Alg. Disc. Math."},{"issue":"1","key":"6_CR11","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1137\/0402008","volume":"2","author":"C.A.J. Hurkens","year":"1989","unstructured":"Hurkens, C.A.J., Schrijver, A.: On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems. SIAM Journal on Discrete Mathematics\u00a02(1), 68\u201372 (1989)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"6","key":"6_CR12","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1145\/950620.950621","volume":"50","author":"K. Jain","year":"2003","unstructured":"Jain, K., et al.: Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP. Journal of the ACM\u00a050(6), 795\u2013824 (2003)","journal-title":"Journal of the ACM"},{"issue":"5","key":"6_CR13","first-page":"306","volume":"70","author":"I. Karapetian","year":"1980","unstructured":"Karapetian, I.: On coloring of arc graphs (in Russian). Dokladi of the Academy of Sciences of the Armenian SSR\u00a070(5), 306\u2013311 (1980)","journal-title":"Dokladi of the Academy of Sciences of the Armenian SSR"},{"issue":"3","key":"6_CR14","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1007\/s00453-001-0023-9","volume":"30","author":"V. Kumar","year":"2001","unstructured":"Kumar, V.: An approximation algorithm for circular arc coloring. Algorithmica\u00a030(3), 406\u2013417 (2001)","journal-title":"Algorithmica"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BFb0053971","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"V. Kumar","year":"1998","unstructured":"Kumar, V.: Approximating circular arc colouring and bandwidth allocation in all\u2013optical ring networks. In: Jansen, K., Rolim, J.D.P. (eds.) APPROX 1998. LNCS, vol.\u00a01444, pp. 147\u2013158. Springer, Heidelberg (1998)"},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/s10878-005-2263-0","volume":"10","author":"J. Li","year":"2005","unstructured":"Li, J., et al.: Maximizing profits of routing in WDM networks. Journal of Combinatorial Optimization\u00a010, 99\u2013111 (2005)","journal-title":"Journal of Combinatorial Optimization"},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/S1389-1286(02)00448-6","volume":"42","author":"C. Nomikos","year":"2003","unstructured":"Nomikos, C., Pagourtzis, A., Zachos, S.: Satisfying a maximum number of pre-routed requests in all-optical rings. Computer Networks\u00a042, 55\u201363 (2003)","journal-title":"Computer Networks"},{"key":"6_CR18","volume-title":"Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM \u201903)","author":"C. Nomikos","year":"2003","unstructured":"Nomikos, C., Pagourtzis, A., Zachos, S.: Minimizing request blocking in all-optical rings. In: Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM \u201903), IEEE Computer Society Press, Los Alamitos (2003)"},{"key":"6_CR19","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF02579324","volume":"7","author":"P. Raghavan","year":"1987","unstructured":"Raghavan, P., Thompson, C.D.: Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica\u00a07, 365\u2013374 (1987)","journal-title":"Combinatorica"},{"key":"6_CR20","volume-title":"Optical networks: A practical perspective","author":"R. Ramaswami","year":"1998","unstructured":"Ramaswami, R., Sivarajan, K.: Optical networks: A practical perspective. Morgan Kaufmann, San Francisco (1998)"},{"key":"6_CR21","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1998","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley and Sons, Chichester (1998)"},{"issue":"3","key":"6_CR22","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1137\/0129040","volume":"29","author":"A. Tucker","year":"1975","unstructured":"Tucker, A.: Coloring a family of circular arcs. SIAM Journal of Applied Mathematics\u00a029(3), 493\u2013502 (1975)","journal-title":"SIAM Journal of Applied Mathematics"},{"issue":"4","key":"6_CR23","doi-asserted-by":"publisher","first-page":"1067","DOI":"10.1137\/S0097539700382157","volume":"32","author":"M. Valencia-Pabon","year":"2003","unstructured":"Valencia-Pabon, M.: Revisiting Tucker\u2019s algorithm to color circular arc graphs. SIAM Journal on Computing\u00a032(4), 1067\u20131072 (2003)","journal-title":"SIAM Journal on Computing"},{"key":"6_CR24","series-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1090\/dimacs\/046\/02","volume-title":"Multichannel Optical Networks: Theory and Practice","author":"P.J. Wan","year":"1998","unstructured":"Wan, P.J., Liu, L.: Maximal throughput in wavelength-routed optical networks. In: Multichannel Optical Networks: Theory and Practice. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a046, pp. 15\u201326. AMS, New York (1998)"}],"container-title":["Lecture Notes in Computer Science","STACS 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70918-3_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:12:02Z","timestamp":1605762722000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70918-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540709176","9783540709183"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70918-3_6","relation":{},"subject":[]}}