P-COMPLETE APPROXIMATION PROBLEMS

[1] BODIN L, 1972, NETWORKS, V2, P307

[2] SCHEDULING INDEPENDENT TASKS TO REDUCE MEAN FINISHING TIME [J]. COMMUNICATIONS OF THE ACM, 1974, 17 (07) : 382 - 387

[3] Conway R, 1967, THEORY SCHEDULING

[4] COMPLEXITY OF NEAR-OPTIMAL GRAPH COLORING [J]. 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]. SIAM JOURNAL ON APPLIED MATHEMATICS, 1969, 17 (02) : 416 - &

[8] EXACT AND APPROXIMATE ALGORITHMS FOR SCHEDULING NONIDENTICAL PROCESSORS [J]. 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]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1974, 9 (03) : 256 - 278

[1] BODIN L, 1972, NETWORKS, V2, P307

[2] SCHEDULING INDEPENDENT TASKS TO REDUCE MEAN FINISHING TIME [J]. COMMUNICATIONS OF THE ACM, 1974, 17 (07) : 382 - 387

[3] Conway R, 1967, THEORY SCHEDULING

[4] COMPLEXITY OF NEAR-OPTIMAL GRAPH COLORING [J]. 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]. SIAM JOURNAL ON APPLIED MATHEMATICS, 1969, 17 (02) : 416 - &

[8] EXACT AND APPROXIMATE ALGORITHMS FOR SCHEDULING NONIDENTICAL PROCESSORS [J]. 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]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1974, 9 (03) : 256 - 278