{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T05:31:15Z","timestamp":1740547875038,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540212362"},{"type":"electronic","value":"9783540247494"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24749-4_23","type":"book-chapter","created":{"date-parts":[[2010,9,8]],"date-time":"2010-09-08T19:01:54Z","timestamp":1283972514000},"page":"258-269","source":"Crossref","is-referenced-by-count":4,"title":["Approximate Path Coloring with Applications to Wavelength Assignment in WDM Optical Networks"],"prefix":"10.1007","author":[{"given":"Ioannis","family":"Caragiannis","sequence":"first","affiliation":[]},{"given":"Christos","family":"Kaklamanis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"23_CR1","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/S0304-3975(01)00310-3","volume":"289","author":"V. Auletta","year":"2002","unstructured":"Auletta, V., Caragiannis, I., Kaklamanis, C., Persiano, P.: Randomized Path Coloring on Binary Trees. Theoretical Computer Science\u00a0289(1), 355\u2013399 (2002)","journal-title":"Theoretical Computer Science"},{"unstructured":"Beauquier, B., Bermond, J.-C., Gargano, L., Hell, P., Perennes, S., Vaccaro, U.: Graph Problems arising from Wavelength-Routing in All-Optical Networks. In: Proc. of the 2nd Workshop on Optics and Computer Science, WOCS 1997 (1997)","key":"23_CR2"},{"key":"23_CR3","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., Ferreira, A., Kaklamanis, C., Perennes, S., Rivano, H.: 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)"},{"issue":"1-2","key":"23_CR4","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/S0304-3975(99)00152-8","volume":"255","author":"T. Erlebach","year":"2000","unstructured":"Erlebach, T., Jansen, K.: The Complexity of Path Coloring and Call Scheduling. Theoretical Computer Science\u00a0255(1-2), 33\u201350 (2000)","journal-title":"Theoretical Computer Science"},{"issue":"1-2","key":"23_CR5","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., Jansen, K., Kaklamanis, C., Mihail, M., Persiano, P.: Optimal Wavelength Routing in Directed Fiber Trees. Theoretical Computer Science\u00a0221(1-2), 119\u2013137 (1999)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"23_CR6","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1023\/A:1026158611840","volume":"24","author":"A. Ferreira","year":"2003","unstructured":"Ferreira, A., Perennes, S., Richa, A.W., Rivano, H., Stier Moses, N.: Models, Complexity and Algorithms for the Design of Multifiber WDM Networks. Telecommunication Systems\u00a024(2), 123\u2013138 (2003)","journal-title":"Telecommunication Systems"},{"issue":"2","key":"23_CR7","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1137\/0601025","volume":"1","author":"M.R. Garey","year":"1980","unstructured":"Garey, M.R., Johnson, D.S., Miller, G.L., Papadimitriou, C.H.: 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."},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M. Gr\u00f6tschel","year":"1981","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: The Ellipsoid Method and its Consequences in Combinatorial Optimization. Combinatorica\u00a01, 169\u2013197 (1981)","journal-title":"Combinatorica"},{"issue":"1-3","key":"23_CR9","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/S0304-3975(02)00829-0","volume":"302","author":"K. Jansen","year":"2003","unstructured":"Jansen, K.: Approximate Strong Separation with Application in Fractional Graph Coloring and Preemptive Scheduling. Theoretical Computer Science\u00a0302(1-3), 239\u2013256 (2003)","journal-title":"Theoretical Computer Science"},{"key":"23_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/3-540-47867-1_24","volume-title":"Integer Programming and Combinatorial Optimization","author":"K. Jansen","year":"2002","unstructured":"Jansen, K., Porkolab, L.: On Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation Schemes. In: Cook, W.J., Schulz, A.S. (eds.) IPCO 2002. LNCS, vol.\u00a02337, pp. 329\u2013349. Springer, Heidelberg (2002)"},{"issue":"3","key":"23_CR11","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"},{"issue":"1","key":"23_CR12","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1109\/90.909024","volume":"9","author":"G. Li","year":"2001","unstructured":"Li, G., Simha, R.: On the Wavelength Assignment Problem on Multifiber WDM Star and Ring Networks. IEEE\/ACM Transactions on Networking\u00a09(1), 60\u201368 (2001)","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"4","key":"23_CR13","doi-asserted-by":"crossref","first-page":"303","DOI":"10.3233\/HSN-1999-173","volume":"8","author":"G. Li","year":"1999","unstructured":"Li, G., Simha, R.: On Bounds for the Wavelength Assignment Problem on Optical Ring Networks. Journal of High-Speed Networks\u00a08(4), 303\u2013309 (1999)","journal-title":"Journal of High-Speed Networks"},{"key":"23_CR14","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/0012-365X(75)90058-8","volume":"13","author":"L. Lov\u00e1sz","year":"1975","unstructured":"Lov\u00e1sz, L.: On the Ratio of Optimal Integral and Fractional Covers. Discrete Mathematics\u00a013, 383\u2013390 (1975)","journal-title":"Discrete Mathematics"},{"key":"23_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"768","DOI":"10.1007\/3-540-45022-X_64","volume-title":"Automata, Languages and Programming","author":"L. Margara","year":"2000","unstructured":"Margara, L., Simon, J.: Wavelength Assignment Problem on All\u2013Optical Networks with k Fibers per Link. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol.\u00a01853, pp. 768\u2013779. Springer, Heidelberg (2000)"},{"key":"23_CR16","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)"},{"key":"23_CR17","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":"23_CR18","volume-title":"Optical Networks: A Practical Perspective","author":"R. Ramaswami","year":"1998","unstructured":"Ramaswami, R., Sivarajan, K.: Optical Networks: A Practical Perspective. Morgan Kauffman Publishers, San Francisco (1998)"},{"issue":"3","key":"23_CR19","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"},{"doi-asserted-by":"crossref","unstructured":"Valencia\u2013Pabon, M.E.: Revisiting Tucker\u2019s Algorithm to Color Circular\u2013Arc Graphs. Electronic Notes on Discrete Mathematics (2000)","key":"23_CR20","DOI":"10.1016\/S1571-0653(04)00259-8"}],"container-title":["Lecture Notes in Computer Science","STACS 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24749-4_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T17:08:30Z","timestamp":1740503310000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24749-4_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212362","9783540247494"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24749-4_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}