{"type":"journal_article","year":"2003","oa_version":"Published Version","volume":66,"title":"Scheduling multicasts on unit-capacity trees and meshes","citation":{"short":"M.H. Henzinger, S. Leonardi, Journal of Computer and System Sciences 66 (2003) 567–611.","ista":"Henzinger MH, Leonardi S. 2003. Scheduling multicasts on unit-capacity trees and meshes. Journal of Computer and System Sciences. 66(3), 567–611.","chicago":"Henzinger, Monika H, and Stefano Leonardi. “Scheduling Multicasts on Unit-Capacity Trees and Meshes.” <i>Journal of Computer and System Sciences</i>. Elsevier, 2003. <a href=\"https://doi.org/10.1016/s0022-0000(03)00043-6\">https://doi.org/10.1016/s0022-0000(03)00043-6</a>.","mla":"Henzinger, Monika H., and Stefano Leonardi. “Scheduling Multicasts on Unit-Capacity Trees and Meshes.” <i>Journal of Computer and System Sciences</i>, vol. 66, no. 3, Elsevier, 2003, pp. 567–611, doi:<a href=\"https://doi.org/10.1016/s0022-0000(03)00043-6\">10.1016/s0022-0000(03)00043-6</a>.","apa":"Henzinger, M. H., &#38; Leonardi, S. (2003). Scheduling multicasts on unit-capacity trees and meshes. <i>Journal of Computer and System Sciences</i>. Elsevier. <a href=\"https://doi.org/10.1016/s0022-0000(03)00043-6\">https://doi.org/10.1016/s0022-0000(03)00043-6</a>","ieee":"M. H. Henzinger and S. Leonardi, “Scheduling multicasts on unit-capacity trees and meshes,” <i>Journal of Computer and System Sciences</i>, vol. 66, no. 3. Elsevier, pp. 567–611, 2003.","ama":"Henzinger MH, Leonardi S. Scheduling multicasts on unit-capacity trees and meshes. <i>Journal of Computer and System Sciences</i>. 2003;66(3):567-611. doi:<a href=\"https://doi.org/10.1016/s0022-0000(03)00043-6\">10.1016/s0022-0000(03)00043-6</a>"},"date_updated":"2023-02-10T08:03:31Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11766","status":"public","doi":"10.1016/s0022-0000(03)00043-6","date_created":"2022-08-08T12:24:35Z","language":[{"iso":"eng"}],"issue":"3","page":"567-611","article_type":"original","date_published":"2003-05-01T00:00:00Z","day":"01","publication_status":"published","article_processing_charge":"No","publisher":"Elsevier","author":[{"first_name":"Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","full_name":"Henzinger, Monika H"},{"last_name":"Leonardi","first_name":"Stefano","full_name":"Leonardi, Stefano"}],"publication_identifier":{"issn":["0022-0000"]},"month":"05","scopus_import":"1","quality_controlled":"1","publication":"Journal of Computer and System Sciences","intvolume":"        66","main_file_link":[{"url":"https://doi.org/10.1016/S0022-0000(03)00043-6","open_access":"1"}],"oa":1,"extern":"1","abstract":[{"lang":"eng","text":"This paper studies the multicast routing and admission control problem on unit-capacity tree and mesh topologies in the throughput model. The problem is a generalization of the edge-disjoint paths problem and is NP-hard both on trees and meshes. We study both the offline and the online version of the problem: In the offline setting, we give the first constant-factor approximation algorithm for trees, and an -factor approximation algorithm for meshes. In the online setting, we give the first polylogarithmic competitive online algorithm for tree and mesh topologies. No polylogarithmic-competitive algorithm is possible on general network topologies (Lower bounds for on-line graph problems with application to on-line circuits and optical routing, in: Proceedings of the 28th ACM Symposium on Theory of Computing, 1996, pp. 531–540) and there exists a polylogarithmic lower bound on the competitive ratio of any online algorithm on tree topologies (Making commitments in the face of uncertainity: how to pick a winner almost every time, in: Proceedings of the 28th Annual ACM Symposium on Theory of Computing, 1996, pp. 519–530). We prove the same lower bound for meshes."}]}