{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:45:52Z","timestamp":1725493552997},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540422877"},{"type":"electronic","value":"9783540482246"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-48224-5_60","type":"book-chapter","created":{"date-parts":[[2007,10,28]],"date-time":"2007-10-28T06:29:04Z","timestamp":1193552944000},"page":"732-743","source":"Crossref","is-referenced-by-count":12,"title":["Fractional Path Coloring with Applications to WDM Networks"],"prefix":"10.1007","author":[{"given":"Ioannis","family":"Caragiannis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Afonso","family":"Ferreira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christos","family":"Kaklamanis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"St\u00e9phane","family":"P\u00e9rennes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Herv\u00e9","family":"Rivano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,7,4]]},"reference":[{"key":"60_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/3-540-44436-X_8","volume-title":"Proc. of the 3rd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX\u201900)","author":"V. Auletta","year":"2000","unstructured":"V. Auletta, I. Caragiannis, C. Kaklamanis, and P. Persiano. Randomized path coloring on binary trees. In Proc. of the 3rd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX\u201900), LNCS 1913, Springer, pp. 60\u201371, 2000."},{"key":"60_CR2","unstructured":"B. Beauquier. Communications dans les r\u00e9seaux optiques par multiplexage en longueur d\u2019onde. PhD thesis, Universit\u00e9 de Nice-Sophia Antipolis, 2000."},{"key":"60_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"574","DOI":"10.1007\/3-540-61440-0_160","volume-title":"Proc. of the 23rd International Colloquium on Automata, Languages and Programming (ICALP\u201996)","author":"J.-C. Bermond","year":"1996","unstructured":"J-C. Bermond, L. Gargano, S. P\u00e9rennes, A. A. Rescigno, and U. Vaccaro. Efficient collective communication in optical networks. In Proc. of the 23rd International Colloquium on Automata, Languages and Programming (ICALP\u201996), LNCS 1099, Springer, pp. 574\u2013585, 1996."},{"issue":"7","key":"60_CR4","doi-asserted-by":"publisher","first-page":"1171","DOI":"10.1109\/26.153361","volume":"40","author":"I. Chlamtac","year":"1992","unstructured":"I. Chlamtac, A. Ganz, and G. Karmi. Lightpath communications: An approach to high bandwidth optical WAN\u2019s. IEEE Transactions on Communications, 40(7):1171\u20131182, 1992.","journal-title":"IEEE Transactions on Communications"},{"issue":"1-2","key":"60_CR5","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/S0304-3975(99)00152-8","volume":"255","author":"T. Erlebach","year":"2001","unstructured":"T. Erlebach and K. Jansen. The Complexity of Path Coloring and Call Scheduling. Theoretical Computer Science, Vol. 255 (1-2), pp. 33\u201350, 2001.","journal-title":"Theoretical Computer Science"},{"issue":"1-2","key":"60_CR6","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/S0304-3975(99)00029-8","volume":"221","author":"T. Erlebach","year":"1999","unstructured":"T. Erlebach, K. Jansen, C. Kaklamanis, M. Mihail, and P. Persiano. Optimal wavelength routing on directed fiber trees. Theoretical Computer Science, 221(1-2):119\u2013137, 1999.","journal-title":"Theoretical Computer Science"},{"key":"60_CR7","series-title":"PhD thesis","volume-title":"Multicommodity Flows and Approximation Algorithms","author":"N. Garg","year":"1994","unstructured":"N. Garg. Multicommodity Flows and Approximation Algorithms. PhD thesis, Indian Institute of Technology, Delhi, April 1994."},{"key":"60_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1007\/3-540-63165-8_206","volume-title":"Proc. of the 24th International Colloquium on Automata, Languages and Programming (ICALP\u201997)","author":"L. Gargano","year":"1997","unstructured":"L. Gargano, P. Hell, and S. P\u00e9rennes. Colouring paths in directed symmetric trees with applications to WDM routing. In Proc. of the 24th International Colloquium on Automata, Languages and Programming (ICALP\u201997), LNCS 1256, Springer, pp. 505\u2013515, 1997."},{"key":"60_CR9","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M. Gr\u00f6tschel","year":"1981","unstructured":"M. Gr\u00f6tschel, L. Lov\u00e1sz, and A. Schrijver. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica, 1:169\u2013197, 1981.","journal-title":"Combinatorica"},{"key":"60_CR10","doi-asserted-by":"crossref","unstructured":"M. Gr\u00f6tschel, L. Lov\u00e1sz, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization, volume 2. Springer, 2nd corrected edition, 1993.","DOI":"10.1007\/978-3-642-78240-4"},{"issue":"5","key":"60_CR11","first-page":"306","volume":"70","author":"I. A. Karapetian","year":"1980","unstructured":"I. A. Karapetian. On coloring of arc graphs. Doklady Akad. Nauk Armianskoi CCP, 70(5):306\u2013311, 1980. (In Russian)","journal-title":"Doklady Akad. Nauk Armianskoi CCP"},{"key":"60_CR12","doi-asserted-by":"crossref","unstructured":"V. Kumar. Approximating circular arc colouring and bandwidth allocation in all-optical ring networks. In Proc. of the 1st International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX\u201998), 1998.","DOI":"10.1007\/BFb0053971"},{"key":"60_CR13","unstructured":"T. Niessen and J. Kind. The round-up property of the fractional chromatic number for proper circular arc graphs. Journal of Graph Theory, 1998."},{"issue":"2","key":"60_CR14","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/0012-365X(85)90051-2","volume":"55","author":"R. E. Tarjan","year":"1985","unstructured":"R. E. Tarjan. Decomposition by clique separators. Discrete Mathematics, 55(2):221\u2013232, 1985.","journal-title":"Discrete Mathematics"},{"issue":"3","key":"60_CR15","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1137\/0129040","volume":"29","author":"A. Tucker","year":"1975","unstructured":"A. Tucker. Coloring a family of circular arcs. SIAM Journal of Applied Mathematics, 29(3):493\u2013502, November 1975.","journal-title":"SIAM Journal of Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48224-5_60","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T02:28:18Z","timestamp":1556936898000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48224-5_60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422877","9783540482246"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-48224-5_60","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}