MINIMAL COVERING PROBLEM AND PLA MINIMIZATION

被引:4
|
作者
YOUNG, MH [1 ]
MUROGA, S [1 ]
机构
[1] UNIV ILLINOIS,DEPT COMP SCI,URBANA,IL 61801
关键词
D O I
10.1007/BF00991179
中图分类号
G25 [图书馆学、图书馆事业]; G35 [情报学、情报工作];
学科分类号
1205 ; 120501 ;
摘要
引用
收藏
页码:337 / 364
页数:28
相关论文
共 50 条
  • [31] BOND COVERING IN THE LATTICE-COVERING PROBLEM
    CASSI, D
    SONCINI, L
    PHYSICAL REVIEW A, 1992, 45 (08): : 6107 - 6108
  • [32] AN EFFICIENT OUTPUT PHASE ASSIGNMENT FOR PLA MINIMIZATION
    WEY, CL
    CHANG, TY
    IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1990, 9 (01) : 1 - 7
  • [33] Submodular Function Minimization under Covering Constraints
    Iwata, Satoru
    Nagano, Kiyohito
    2009 50TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE: FOCS 2009, PROCEEDINGS, 2009, : 671 - 680
  • [34] MULTIPLE-VALUED MINIMIZATION FOR PLA OPTIMIZATION
    RUDELL, RL
    SANGIOVANNIVINCENTELLI, A
    IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1987, 6 (05) : 727 - 750
  • [35] On a cone covering problem
    Elbassioni, Khaled
    Tiwary, Hans Raj
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2011, 44 (03): : 129 - 134
  • [36] The gradual covering problem
    Drezner, Z
    Wesolowsky, GO
    Drezner, T
    NAVAL RESEARCH LOGISTICS, 2004, 51 (06) : 841 - 855
  • [37] EDGE COVERING PROBLEM
    HUNG, MS
    OPERATIONS RESEARCH, 1975, 23 : B350 - B350
  • [38] On a Covering Problem in the Hypercube
    Lale Özkahya
    Brendon Stanton
    Graphs and Combinatorics, 2015, 31 : 235 - 242
  • [39] THE COVERING SALESMAN PROBLEM
    CURRENT, JR
    SCHILLING, DA
    TRANSPORTATION SCIENCE, 1989, 23 (03) : 208 - 213
  • [40] The covering tour problem
    Gendreau, M
    Laporte, G
    Semet, F
    OPERATIONS RESEARCH, 1997, 45 (04) : 568 - 576