POLYNOMIAL-TIME ALGORITHMS FOR REGULAR SET-COVERING AND THRESHOLD SYNTHESIS

被引：55

作者：

PELED, UN ^{[1
]}

SIMEONE, B ^{[1
]}

机构：

[1] UNIV ROME LA SAPIENZA,DEPT STAT,ROME,ITALY

来源：

DISCRETE APPLIED MATHEMATICS | 1985年 / 12卷 / 01期

关键词：

All Open Access; Bronze;

D O I：

10.1016/0166-218X(85)90040-X

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

COMPUTER PROGRAMMING

引用

页码：57 / 69

页数：13

共 18 条

[1]

Bradley G. H., 1974, Mathematical Programming, V7, P263, DOI 10.1007/BF01585527

[2]

CHVATAL V, 1977, ANN DISCRETE MATH, V1, P145

[3]

Edmonds J., 1970, J COMB THEORY, V8, P299, DOI DOI 10.1016/S0021-9800(70)80083-7

[4] REGULAR (2,2)-SYSTEMS [J].

EULER, R .

MATHEMATICAL PROGRAMMING, 1982, 24 (03) :269-283

[5] A CHARACTERIZATION OF THRESHOLD MATROIDS [J].

GILES, R ;

KANNAN, R .

DISCRETE MATHEMATICS, 1980, 30 (02) :181-184

[6]

HAMMER PL, 1979, IEEE T COMPUT, V28, P238, DOI 10.1109/TC.1979.1675324

[7]

IBARAKI T, 1981, COMMUNICATION

[8] A NEW POLYNOMIAL-TIME ALGORITHM FOR LINEAR-PROGRAMMING [J].

KARMARKAR, N .

COMBINATORICA, 1984, 4 (04) :373-395

[9]

KLEITMAN D, 1975, AM MATH SOC T, V213, P373

[10] GENERATING ALL MAXIMAL INDEPENDENT SETS - NP-HARDNESS AND POLYNOMIAL-TIME ALGORITHMS [J].

LAWLER, EL ;

LENSTRA, JK ;

KAN, AHGR .

SIAM JOURNAL ON COMPUTING, 1980, 9 (03) :558-565

← 1 2 →