{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:27:20Z","timestamp":1725560840090},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540210795"},{"type":"electronic","value":"9783540245926"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24592-6_7","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T03:13:33Z","timestamp":1280373213000},"page":"81-94","source":"Crossref","is-referenced-by-count":1,"title":["Fractional and Integral Coloring of Locally-Symmetric Sets of Paths on Binary Trees"],"prefix":"10.1007","author":[{"given":"Ioannis","family":"Caragiannis","sequence":"first","affiliation":[]},{"given":"Christos","family":"Kaklamanis","sequence":"additional","affiliation":[]},{"given":"Pino","family":"Persiano","sequence":"additional","affiliation":[]},{"given":"Anastasios","family":"Sidiropoulos","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"7_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"},{"key":"7_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., 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":"4","key":"7_CR3","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1142\/S0129626400000299","volume":"10","author":"I. Caragiannis","year":"2000","unstructured":"Caragiannis, I., Kaklamanis, C., Persiano, P.: Symmetric Communication in All\u2013 Optical Tree Networks. Parallel Processing Letters\u00a010(4), 305\u2013313 (2000)","journal-title":"Parallel Processing Letters"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/10719839_32","volume-title":"LATIN 2000: Theoretical Informatics","author":"S. Corteel","year":"2000","unstructured":"Corteel, S., Gardy, D., Barth, D., Denise, A., Valencia-Pabon, M.: On the Complexity of Routing Permutations on Trees by Arc-Disjoint Paths. In: Gonnet, G.H., Viola, A. (eds.) LATIN 2000. LNCS, vol.\u00a01776, pp. 308\u2013317. Springer, Heidelberg (2000)"},{"issue":"1-2","key":"7_CR5","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":"7_CR6","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"},{"key":"7_CR7","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":"7_CR8","unstructured":"Kumar, V., Schwabe, E.: Improved Access to Optical Bandwidth in Trees. In: Proc. of the 8th Annual ACM\u2013SIAM Symposium on Discrete Algorithms (SODA 1997), pp. 437\u2013444 (1997)"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Raghavan, P., Upfal, E.: Efficient Routing in All-Optical Networks. In: Proc. of the 26th Annual Symposium on Theory of Computing (STOC 1994), pp. 133\u2013143 (1994)","DOI":"10.1145\/195058.195119"},{"key":"7_CR10","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)"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24592-6_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T09:36:47Z","timestamp":1552815407000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24592-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540210795","9783540245926"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24592-6_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}