THE VIA MINIMIZATION PROBLEM IS NP-COMPLETE

被引：24
作者：
NACLERIO, NJ
MASUDA, S
NAKAJIMA, K
机构：
[1] UNIV MARYLAND, SYST RES CTR, COLLEGE PK, MD 20742 USA
[2] UNIV MARYLAND, INST ADV COMP STUDIES, DEPT ELECT ENGN, COLLEGE PK, MD 20742 USA
来源：
IEEE TRANSACTIONS ON COMPUTERS | 1989年 / 38卷 / 11期
关键词：
D O I：
10.1109/12.42135
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：1604 / 1608
页数：5
相关论文
共 16 条
  • [1] EFFICIENT ALGORITHMS FOR LAYER ASSIGNMENT PROBLEM
    CHANG, KC
    DU, DHC
    [J]. IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1987, 6 (01) : 67 - 78
  • [2] CHEN RW, 1983, IEEE T CIRCUITS SYST, V30, P284, DOI 10.1109/TCS.1983.1085357
  • [3] CIELIELSKI MJ, 1981, 18TH P DES AUT C NAS, P733
  • [4] Fary I., 1948, ACTA SCI MATH SZEGED, V11, P229
  • [5] Garey M. R., 1976, Theoretical Computer Science, V1, P237, DOI 10.1016/0304-3975(76)90059-1
  • [6] RECTILINEAR STEINER TREE PROBLEM IS NP-COMPLETE
    GAREY, MR
    JOHNSON, DS
    [J]. SIAM JOURNAL ON APPLIED MATHEMATICS, 1977, 32 (04) : 826 - 834
  • [7] Garey MR., 1979, COMPUTERS INTRACTABI
  • [8] HASHIMOTO A, 1971, 8TH P DES AUT WORKSH, P155
  • [9] Hsu C.-P., 1983, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, VCAD-2, P235
  • [10] KAJITANI Y, 1980, 1980 P IEEE INT C CI, P295
12