{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:51:31Z","timestamp":1725486691051},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540679967"},{"type":"electronic","value":"9783540444367"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44436-x_8","type":"book-chapter","created":{"date-parts":[[2007,6,18]],"date-time":"2007-06-18T05:33:14Z","timestamp":1182144794000},"page":"60-71","source":"Crossref","is-referenced-by-count":12,"title":["Randomized Path Coloring on Binary Trees"],"prefix":"10.1007","author":[{"given":"Vincenzo","family":"Auletta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ioannis","family":"Caragiannis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christos","family":"Kaklamanis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pino","family":"Persiano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,3]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"V. Auletta, I. Caragiannis, C. Kaklamanis, P. Persiano. Randomized Path Coloring on Binary Trees. CTI Technical Report 2000-01-05, January 2000. http:\/\/students.ceid.upatras.gr\/~caragian\/ackp00.ps","DOI":"10.1007\/3-540-44436-X_8"},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"357","DOI":"10.2748\/tmj\/1178243286","volume":"19","author":"K. Azuma","year":"1967","unstructured":"K. Azuma. Weighted Sums of Certain Dependent Random Variables. Tohoku Mathematical Journal, 19:357\u2013367, 1967.","journal-title":"Tohoku Mathematical Journal"},{"key":"8_CR3","unstructured":"I. Caragiannis, C. Kaklamanis, P. Persiano. Bounds on Optical Bandwidth Allocation on Directed Fiber Tree Topologies. 2nd Workshop on Optics and Computer Science (WOCS\u2019 97), 1997."},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1214\/aoms\/1177729330","volume":"23","author":"H. Cherno","year":"1952","unstructured":"H. Cherno.. A Measure of Asymptotic Efficiency for Tests of a Hypothesis based on the Sum of Observations. Annals of Mathematical Statistics, 23:493\u2013509, 1952.","journal-title":"Annals of Mathematical Statistics"},{"key":"8_CR5","unstructured":"T. Erlebach, K. Jansen. Scheduling of Virtual Connections in Fast Networks. In Proc. of the 4th Workshop on Parallel Systems and Algorithms, pp. 13\u201332, 1996."},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"T. Erlebach, K. Jansen. Call Scheduling in Trees, Rings and Meshes. In Proc. of the 30th Hawaii International Conference on System Sciences, 1997.","DOI":"10.1109\/HICSS.1997.667220"},{"key":"8_CR7","unstructured":"W. Feller. An Introduction to Probability Theory and Its Applications: Volume I, John Wiley and Sons, 1968."},{"key":"8_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\u2019 97)","author":"L. Gargano","year":"1997","unstructured":"L. Gargano, P. Hell, S. Perennes, Colouring All Directed Paths in a Symmetric Tree with Applications to WDM Routing. In Proc. of the 24th International Colloquium on Automata, Languages, and Programming (ICALP\u2019 97), LNCS 1256, Springer, pp. 505\u2013515."},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"13","DOI":"10.2307\/2282952","volume":"58","author":"W. Hoeffding","year":"1963","unstructured":"W. Hoeffding. Probability Inequalities for sums of Bounded Random Variables. Journal of the American Statistics Association, 58:13\u201330, 1963.","journal-title":"Journal of the American Statistics Association"},{"key":"8_CR10","unstructured":"K. Jansen. Approximation Results for Wavelength Routing in Directed Trees. 2nd Workshop on Optics and Computer Science (WOCS\u2019 97), 1997."},{"key":"8_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1007\/3-540-61680-2_75","volume-title":"Proc. of the 4th European Symposium on Algorithms (ESA\u2019 96)","author":"C. Kaklamanis","year":"1996","unstructured":"C. Kaklamanis, P. Persiano. Efficient Wavelength Routing on Directed Fiber Trees. In Proc. of the 4th European Symposium on Algorithms (ESA\u2019 96), LNCS 1136, Springer Verlag, 1996, pp. 460\u2013470."},{"key":"8_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1007\/3-540-63165-8_205","volume-title":"Proc. of the 24th International Colloquium on Automata, Languages, and Programming (ICALP\u2019 97)","author":"C. Kaklamanis","year":"1997","unstructured":"C. Kaklamanis, P. Persiano, T. Erlebach, K. Jansen. Constrained Bipartite Edge Coloring with Applications to Wavelength Routing. In Proc. of the 24th International Colloquium on Automata, Languages, and Programming (ICALP\u2019 97), LNCS 1256, Springer Verlag, 1997, pp. 493\u2013504."},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"A. Kamath, R. Motwani, K. Palem, and P. Spirakis. Tail bounds for occupancy and the satisfiability threshold conjecture. In Proc. of the 35th Annual IEEE Symposium on Foundations of Computer Science (FOCS\u2019 94), pp. 592\u2013603, 1994.","DOI":"10.1109\/SFCS.1994.365732"},{"key":"8_CR14","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\u2019 98), 1998.","DOI":"10.1007\/BFb0053971"},{"key":"8_CR15","unstructured":"V. Kumar, E. Schwabe. Improved Access to Optical Bandwidth in Trees. In Proc. of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u2019 97), 1997, pp. 437\u2013444."},{"key":"8_CR16","unstructured":"M. Mihail, C. Kaklamanis, S. Rao. Efficient Access to Optical Bandwidth. In Proc. of the 36th Annual Symposium on Foundations of Computer Science (FOCS\u2019 95), 1995, pp. 548\u2013557."},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"R. Motwani, P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.","DOI":"10.1017\/CBO9780511814075"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Y. Rabani. Path Coloring on the Mesh. In Proc. of the 37th Annual Symposium on Foundations of Computer Science (FOCS\u2019 96), 1996.","DOI":"10.1109\/SFCS.1996.548499"},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"P. Raghavan, E. Upfal. Efficient Routing in All-Optical Networks. In Proc. of the 26th Annual Symposium on Theory of Computing (STOC\u2019 94), 1994, pp. 133\u2013143.","DOI":"10.1145\/195058.195119"},{"key":"8_CR20","unstructured":"R. Ramaswami, K. Sivarajan. Optical Networks. Morgan Kauffman Publishers, 1998."},{"key":"8_CR21","unstructured":"J. P. Schmidt, A. Siegel, A. Srinivasan. Cherno.-Hoeffding Bounds for Applications with Limited Independence. In Proc. of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u2019 93), 1993, pp. 331\u2013340."}],"container-title":["Lecture Notes in Computer Science","Approximation Algorithms for Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44436-X_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T07:45:38Z","timestamp":1683877538000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44436-X_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679967","9783540444367"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-44436-x_8","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}