{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T05:28:49Z","timestamp":1734067729617,"version":"3.30.2"},"reference-count":22,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3766,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0022-0000(03)00043-6","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T01:09:12Z","timestamp":1052788152000},"page":"567-611","source":"Crossref","is-referenced-by-count":2,"title":["Scheduling multicasts on unit-capacity trees and meshes"],"prefix":"10.1016","volume":"66","author":[{"given":"Monika R.","family":"Henzinger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefano","family":"Leonardi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(03)00043-6_BIBALI97","unstructured":"P. Alimonti, 1997, Personal communication."},{"key":"10.1016\/S0022-0000(03)00043-6_BIBAWE96","doi-asserted-by":"crossref","unstructured":"B. Awerbuch, Online selective multicast and maximal dense trees: A survey, 1996, available as http:\/\/www.cs.jhu.edu\/baruch\/MULTICAST\/index.html.","DOI":"10.1145\/258533.258619"},{"key":"10.1016\/S0022-0000(03)00043-6_BIBAAFL96","doi-asserted-by":"crossref","unstructured":"B. Awerbuch, Y. Azar, A. Fiat, T. Leighton, Making commitments in the face of uncertainty: how to pick a winner almost every time, in: Proceedings of the 28th Annual ACM Symposium on Theory of Computing, Philadelphia, PA, 1996, pp. 519\u2013530.","DOI":"10.1145\/237814.238000"},{"key":"10.1016\/S0022-0000(03)00043-6_BIBAAP93","doi-asserted-by":"crossref","unstructured":"B. Awerbuch, Y. Azar, S. Plotkin, Throughput-competitive online routing, in: 34th IEEE Symposium on Foundations of Computer Science, Palo Alto, CA, 1993, pp. 32\u201340.","DOI":"10.1109\/SFCS.1993.366884"},{"key":"10.1016\/S0022-0000(03)00043-6_BIBABFR94","unstructured":"B. Awerbuch, Y. Bartal, A. Fiat, A. Ros\u00e9n, Competitive non-preemptive call control, in: Proceedings of Fifth ACM-SIAM Symposium on Discrete Algorithms, Arlington, VA, 1994, pp. 312\u2013320."},{"key":"10.1016\/S0022-0000(03)00043-6_BIBAGLR94","doi-asserted-by":"crossref","unstructured":"B. Awerbuch, R. Gawlick, T. Leighton, Y. Rabani, On-line admission control and circuit routing for high performance computing and communication, in: Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, Santa Fe, New Mexico, 1994, pp. 412\u2013423.","DOI":"10.1109\/SFCS.1994.365675"},{"key":"10.1016\/S0022-0000(03)00043-6_BIBAS97","doi-asserted-by":"crossref","unstructured":"B. Awerbuch, T. Singh, On-line algorithms for selective multicast and maximal dense trees, in: Proceedings of the 29th Annual ACM Symposium on Theory of Computing, El Paso, TX, 1997, pp. 354\u2013362.","DOI":"10.1145\/258533.258619"},{"key":"10.1016\/S0022-0000(03)00043-6_BIBBFL96","doi-asserted-by":"crossref","unstructured":"Y. Bartal, A. Fiat, S. Leonardi, Lower bounds for on-line graph problems with application to on-line circuit and optical routing, in: Proceedings of the 28th ACM Symposium on Theory of Computing, Philadelphia, PA, 1996, pp. 531\u2013540.","DOI":"10.1145\/237814.238001"},{"key":"10.1016\/S0022-0000(03)00043-6_BIBGAR96","doi-asserted-by":"crossref","unstructured":"N. Garg, A 3-approximation for the minimum tree spanning k-vertices, in: Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, Burlington, VT, 1996, pp. 302\u2013309.","DOI":"10.1109\/SFCS.1996.548489"},{"key":"10.1016\/S0022-0000(03)00043-6_BIBGK98","doi-asserted-by":"crossref","unstructured":"N. Garg, J. K\u00f6nemann, Faster and simpler algorithms for multicommodity flow and other fractional packing problems, Technical Report MPI-I-97-1-025, Max-Planck-Institut f\u00fcr Informatik, 1998.","DOI":"10.1109\/SFCS.1998.743463"},{"key":"10.1016\/S0022-0000(03)00043-6_BIBGVY93","doi-asserted-by":"crossref","unstructured":"N. Garg, V.V. Vazirani, M. Yannakakis, Approximate max-flow min-(multi)cut theorems and their applications, in: Proceedings of the International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, Springer, Berlin, 1993, pp. 64\u201375.","DOI":"10.1145\/167088.167266"},{"key":"10.1016\/S0022-0000(03)00043-6_BIBGHP98","unstructured":"A. Goel, M.R. Henzinger, S. Plotkin, Online throughput-competitive algorithm for multicast routing and admission control, in: Proceedings of the Ninth ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, 1998, pp. 97\u2013106. A full version available at http::\/\/www.research.digital.com\/SRC\/personal\/monika\/papers.html."},{"key":"10.1016\/S0022-0000(03)00043-6_BIBHOC97","doi-asserted-by":"crossref","unstructured":"D. Hochbaum, Approximation Algorithms for NP-Hard Problems, PWS, 1997.","DOI":"10.1145\/261342.571216"},{"key":"10.1016\/S0022-0000(03)00043-6_BIBKT95","doi-asserted-by":"crossref","unstructured":"J. Kleinberg, \u00c8. Tardos, Disjoint paths in densely embedded graphs, in: Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, Milwaukee, WI, 1995, pp. 52\u201361.","DOI":"10.1109\/SFCS.1995.492462"},{"key":"10.1016\/S0022-0000(03)00043-6_BIBLMSPR98","unstructured":"S. Leonardi, A. Marchetti-Spaccamela, A. Presciutti, A. Ros\u00e8n, On-line randomized call-control revisited, in: Proceedings of the Ninth ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, 1998, pp. 323\u2013332."},{"key":"10.1016\/S0022-0000(03)00043-6_BIBMKR95","doi-asserted-by":"crossref","unstructured":"M. Mihail, C. Kaklamanis, S. Rao, Efficient access to optical bandwidth, in: Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, Milwaukee, WI, 1995, pp. 548\u2013557.","DOI":"10.1109\/SFCS.1995.492585"},{"key":"10.1016\/S0022-0000(03)00043-6_BIBPST95","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1287\/moor.20.2.257","article-title":"Fast approximation algorithms for fractional packing and covering problems","volume":"20","author":"Plotkin","year":"1995","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0022-0000(03)00043-6_BIBRAB96","doi-asserted-by":"crossref","unstructured":"Y. Rabani, Path-coloring on the mesh, in: Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, Burlington, VT, 1996, pp. 400\u2013409.","DOI":"10.1109\/SFCS.1996.548499"},{"issue":"37","key":"10.1016\/S0022-0000(03)00043-6_BIBRAG88","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/0022-0000(88)90003-7","article-title":"Probabilistic construction of deterministic algorithms","volume":"2","author":"Raghavan","year":"1988","journal-title":"J. Comput. Systems Sci."},{"key":"10.1016\/S0022-0000(03)00043-6_BIBRU94","doi-asserted-by":"crossref","unstructured":"P. Raghavan, E. Upfal, Efficient routing in all-optical networks, in: Proceedings of the 26th Annual ACM Symposium on Theory of Computing, Montreal, Canada, 1994, pp. 133\u2013143.","DOI":"10.1145\/195058.195119"},{"key":"10.1016\/S0022-0000(03)00043-6_BIBVLE90","doi-asserted-by":"crossref","unstructured":"Jan van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Vol. A. Algorithms and Complexity, MIT Press, Cambridge, MA, 1990.","DOI":"10.1016\/B978-0-444-88071-0.50015-1"},{"key":"10.1016\/S0022-0000(03)00043-6_BIBYOU95","unstructured":"N. Young, Randomized rounding without solving the linear program, in: Proceedings of the Sixth ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, 1995, pp. 170\u2013178."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000003000436?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000003000436?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T17:14:01Z","timestamp":1734023641000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000003000436"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0022000003000436"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(03)00043-6","relation":{},"ISSN":["0022-0000"],"issn-type":[{"type":"print","value":"0022-0000"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}