{"publication":"Journal of Computer and System Sciences","date_created":"2022-08-08T12:24:35Z","article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/S0022-0000(03)00043-6"}],"publisher":"Elsevier","_id":"11766","extern":"1","author":[{"last_name":"Henzinger","full_name":"Henzinger, Monika H","first_name":"Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"last_name":"Leonardi","first_name":"Stefano","full_name":"Leonardi, Stefano"}],"article_type":"original","page":"567-611","volume":66,"year":"2003","issue":"3","oa_version":"Published Version","abstract":[{"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.","lang":"eng"}],"oa":1,"quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1016/s0022-0000(03)00043-6","date_updated":"2024-11-06T08:21:23Z","type":"journal_article","publication_status":"published","citation":{"ama":"Henzinger M, 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>","ista":"Henzinger M, Leonardi S. 2003. Scheduling multicasts on unit-capacity trees and meshes. Journal of Computer and System Sciences. 66(3), 567–611.","apa":"Henzinger, M., &#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>","short":"M. Henzinger, S. Leonardi, Journal of Computer and System Sciences 66 (2003) 567–611.","ieee":"M. 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.","mla":"Henzinger, Monika, 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>.","chicago":"Henzinger, Monika, 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>."},"publication_identifier":{"issn":["0022-0000"]},"title":"Scheduling multicasts on unit-capacity trees and meshes","month":"05","language":[{"iso":"eng"}],"date_published":"2003-05-01T00:00:00Z","day":"01","intvolume":"        66","scopus_import":"1","status":"public"}