COMBINATORIAL PROBLEMS - REDUCIBILITY AND APPROXIMATION

[1] Aho A. V., 1974, DESIGN ANAL COMPUTER

[2] ANGULIN D, 1977, 9TH P ANN ACM S THEO, P30

[3] [Anonymous], [No title captured]

[4] [Anonymous], 1971, STOC 71, DOI DOI 10.1145/800157.805047

[5] BRADLEY GH, 1961, MANAGE SCI, V17, P354

[6] BRUCKER P, UNPUBLISHED

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

[8] BRUNO J, 1974, P IFIPS C N HOLL AMS, V74, P504

[9] CHRISTOFIDES N, 1976, 388 CARN MELL U MAN

[10] Coffman E.G., 1976, COMPUTER JOB SHOP SC

[1] Aho A. V., 1974, DESIGN ANAL COMPUTER

[2] ANGULIN D, 1977, 9TH P ANN ACM S THEO, P30

[3] [Anonymous], [No title captured]

[4] [Anonymous], 1971, STOC 71, DOI DOI 10.1145/800157.805047

[5] BRADLEY GH, 1961, MANAGE SCI, V17, P354

[6] BRUCKER P, UNPUBLISHED

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

[8] BRUNO J, 1974, P IFIPS C N HOLL AMS, V74, P504

[9] CHRISTOFIDES N, 1976, 388 CARN MELL U MAN

[10] Coffman E.G., 1976, COMPUTER JOB SHOP SC