Optimal bounds for matching routing on trees

被引：0
|
作者：
Zhang, LX
机构：
来源：
PROCEEDINGS OF THE EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS | 1997年
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
The permutation routing problem is studied for trees under the matching model. By introducing a novel and useful (so-called) caterpillar tree partition, we prove that any permutation on an n-node tree (and thus graph) can be routed in at most 3/2n + O(log n) steps. This answers an open problem of Alon, Chung and Graham.
引用
收藏
页码：445 / 453
页数：9
相关论文
共 50 条
  • [41] BOUNDS FOR WEIGHT BALANCED TREES
    RISSANEN, J
    [J]. IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1973, 17 (02) : 101 - 105
  • [42] An optimal scheduling and routing under adaptive spectrum-matching framework for MIMO systems
    Sindhwani, Nidhi
    Bhamrah, Manjit Singh
    [J]. INTERNATIONAL JOURNAL OF ELECTRONICS, 2017, 104 (07) : 1238 - 1253
  • [43] ON OPTIMAL TREES
    EADES, P
    STAPLES, J
    [J]. JOURNAL OF ALGORITHMS, 1981, 2 (04) : 369 - 384
  • [44] Location routing problems on trees
    Araoz, Julian
    Fernandez, Elena
    Rueda, Salvador
    [J]. DISCRETE APPLIED MATHEMATICS, 2019, 259 : 1 - 18
  • [45] Routing on trees via matchings
    Roberts, A
    Symvonis, A
    Zhang, LX
    [J]. ALGORITHMS AND DATA STRUCTURES, 1995, 955 : 251 - 262
  • [46] A note on optical routing on trees
    Kumar, SR
    Panigrahy, R
    Russell, A
    Sundaram, R
    [J]. INFORMATION PROCESSING LETTERS, 1997, 62 (06) : 295 - 300
  • [47] Directed trees in multicast routing
    Nicolau, MJ
    Costa, A
    Santos, A
    Freitas, V
    [J]. QUALITY OF SERVICE IN MULTISERVICE IP NETWORKS, PROCEEDINGS, 2003, 2601 : 320 - 333
  • [48] On properties of multicast routing trees
    Janic, M
    Van Mieghem, P
    [J]. INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, 2006, 19 (01) : 95 - 114
  • [49] Optimal broadcasting and gossiping in one-port meshes of trees with distance-insensitive routing
    Salinger, P
    Tvrdík, P
    [J]. PARALLEL COMPUTING, 2002, 28 (04) : 627 - 647
  • [50] Bounds for optimal coverings
    Moreira, CGTD
    Kohayakawa, Y
    [J]. DISCRETE APPLIED MATHEMATICS, 2004, 141 (1-3) : 263 - 276
12345