P-COMPLETE APPROXIMATION PROBLEMS

被引：1033

作者：

SAHNI, S

GONZALEZ, T

机构：

[1] UNIV MINNESOTA, DEPT CROP SCI, MINNEAPOLIS, MN 55455 USA

[2] UNIV MINNESOTA, MINNEAPOLIS, MN 55455 USA

来源：

JOURNAL OF THE ACM | 1976年 / 23卷 / 03期

关键词：

D O I：

10.1145/321958.321975

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：555 / 565

页数：11

共 19 条

[1]

BODIN L, 1972, NETWORKS, V2, P307

[2] SCHEDULING INDEPENDENT TASKS TO REDUCE MEAN FINISHING TIME [J].

BRUNO, J ;

COFFMAN, EG ;

SETHI, R .

COMMUNICATIONS OF THE ACM, 1974, 17 (07) :382-387

[3]

Conway R, 1967, THEORY SCHEDULING

[4] COMPLEXITY OF NEAR-OPTIMAL GRAPH COLORING [J].

GAREY, MR ;

JOHNSON, DS .

JOURNAL OF THE ACM, 1976, 23 (01) :43-49

[5]

GAREY MR, TO BE PUBLISHED

[6]

Garfinkel R. S., 1972, INTEGER PROGRAMMING

[7] BOUNDS ON MULTIPROCESSING TIMING ANOMALIES [J].

GRAHAM, RL .

SIAM JOURNAL ON APPLIED MATHEMATICS, 1969, 17 (02) :416-&

[8] EXACT AND APPROXIMATE ALGORITHMS FOR SCHEDULING NONIDENTICAL PROCESSORS [J].

HOROWITZ, E ;

SAHNI, S .

JOURNAL OF THE ACM, 1976, 23 (02) :317-327

[9]

JOHNSON DB, 1970, ISR18 CORN U SCI REP, P1

[10] APPROXIMATION ALGORITHMS FOR COMBINATORIAL PROBLEMS [J].

JOHNSON, DS .

JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1974, 9 (03) :256-278

← 1 2 →