MAX-MIN TREE PARTITIONING

被引：60
|
作者：
PERL, Y [1 ]
SCHACH, SR [1 ]
机构：
[1] WEIZMANN INST SCI,REHOVOT 76100,ISRAEL
来源：
JOURNAL OF THE ACM | 1981年 / 28卷 / 01期
关键词：
D O I：
10.1145/322234.322236
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：5 / 15
页数：11
相关论文
共 50 条
  • [1] Max-min partitioning of grid graphs into connected components
    Becker, R
    Lari, I
    Lucertini, M
    Simeone, B
    [J]. NETWORKS, 1998, 32 (02) : 115 - 125
  • [2] A polynomial-time algorithm for max-min partitioning of ladders
    Becker, R
    Lari, I
    Lucertini, M
    Simeone, B
    [J]. THEORY OF COMPUTING SYSTEMS, 2001, 34 (04) : 353 - 374
  • [3] A Polynomial-Time Algorithm for Max-Min Partitioning of Ladders
    R. Becker
    I. Lari
    M. Lucertini
    B. Simeone
    [J]. Theory of Computing Systems, 2001, 34 : 353 - 374
  • [4] A Distributed Algorithm for Min-Max Tree and Max-Min Cut Problems in Communication Networks
    Guo, Song
    Leung, Victor C. M.
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 2010, 18 (04) : 1067 - 1076
  • [5] MAX-MIN PROBLEMS
    KAPUR, KC
    [J]. NAVAL RESEARCH LOGISTICS, 1973, 20 (04) : 639 - 644
  • [6] A MAX-MIN PROBLEM
    MARSH, DCB
    [J]. AMERICAN MATHEMATICAL MONTHLY, 1967, 74 (1P1): : 86 - &
  • [7] Max-min separability
    Bagirov, AM
    [J]. OPTIMIZATION METHODS & SOFTWARE, 2005, 20 (2-3): : 271 - 290
  • [8] Max-min overlay multicast: Rate allocation and tree construction
    Cui, Y
    Xue, Y
    Nahrstedt, K
    [J]. 2004 TWELFTH IEEE INTERNATIONAL WORKSHOP ON QUALITY OF SERVICE, 2004, : 221 - 231
  • [9] A SHIFTING ALGORITHM FOR MIN-MAX TREE PARTITIONING
    BECKER, RI
    SCHACH, SR
    PERL, Y
    [J]. JOURNAL OF THE ACM, 1982, 29 (01) : 58 - 67
  • [10] Min-max and max-min graph saturation parameters
    Sudha, S.
    Arumugam, S.
    [J]. AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2020, 17 (03) : 943 - 947
12345