COMPUTER-AIDED COMPLEXITY CLASSIFICATION OF COMBINATORIAL PROBLEMS

被引:26
作者
LAGEWEG, BJ
LENSTRA, JK
LAWLER, EL
KAN, AHGR
机构
[1] UNIV CALIF BERKELEY,DIV COMP SCI,BERKELEY,CA 94720
[2] ERASMUS UNIV,INST ECONOMETR,3000 DR ROTTERDAM,NETHERLANDS
关键词
D O I
10.1145/358690.363066
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:817 / 822
页数:6
相关论文
共 22 条
[1]  
Baker K., 1974, INTRO SEQUENCING SCH
[2]  
BLAZEWICZ J, 1976, MODELLING PERFORMANC, P57
[3]  
COFFMAN EG, 1972, ACTA INFORM, V1, P200, DOI DOI 10.1007/BF00288685
[4]  
Garey Michael R., 1979, COMPUTERS INTRACTABI
[5]   STRONG NP-COMPLETENESS RESULTS - MOTIVATION, EXAMPLES, AND IMPLICATIONS [J].
GAREY, MR ;
JOHNSON, DS .
JOURNAL OF THE ACM, 1978, 25 (03) :499-508
[6]  
Graham R. L., 1979, Discrete Optimisation, P287
[8]  
Karp R.M., 1972, COMPLEXITY COMPUTER
[9]  
LABETOULLE J, 1979, BW99 MATH CENTR REP
[10]  
LAGEWEG BJ, 1981, BW138 MATH CENTR REP