---
res:
  bibo_abstract:
  - '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.@eng'
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Monika H
      foaf_name: Henzinger, Monika H
      foaf_surname: Henzinger
      foaf_workInfoHomepage: http://www.librecat.org/personId=540c9bbd-f2de-11ec-812d-d04a5be85630
    orcid: 0000-0002-5008-6530
  - foaf_Person:
      foaf_givenName: Stefano
      foaf_name: Leonardi, Stefano
      foaf_surname: Leonardi
  bibo_doi: 10.1016/s0022-0000(03)00043-6
  bibo_issue: '3'
  bibo_volume: 66
  dct_date: 2003^xs_gYear
  dct_isPartOf:
  - http://id.crossref.org/issn/0022-0000
  dct_language: eng
  dct_publisher: Elsevier@
  dct_title: Scheduling multicasts on unit-capacity trees and meshes@
...