APPROXIMATION ALGORITHMS FOR COMBINATORIAL PROBLEMS

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

[2] GRAHAM RL, 1972, SPR P AFIPS JOINT CO, P205

[3] Johnson D., 1973, THESIS MASSACHUSETTS

[4] JOHNSON DS, 1972, 13TH P ANN IEEE S SW, P144

[5] Karp Richard M., 1972, COMPLEXITY COMPUTER, P85

[6] Matula DW, 1972, GRAPH THEORY COMPUTI, P109, DOI DOI 10.1016/B978-1-4832-3187-7.50015-5

[7] SAHNI S, 1973, THESIS CORNELL U

[8] SPENCER JE, PRIVATE COMMUNICATIO

[9] WELSH DJA, 1967, COMPUT J, V10, P85

[10] A TECHNIQUE FOR COLOURING A GRAPH APPLICABLE TO LARGE SCALE TIMETABLING PROBLEMS [J]. COMPUTER JOURNAL, 1969, 12 (04) : 317 - &

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

[2] GRAHAM RL, 1972, SPR P AFIPS JOINT CO, P205

[3] Johnson D., 1973, THESIS MASSACHUSETTS

[4] JOHNSON DS, 1972, 13TH P ANN IEEE S SW, P144

[5] Karp Richard M., 1972, COMPLEXITY COMPUTER, P85

[6] Matula DW, 1972, GRAPH THEORY COMPUTI, P109, DOI DOI 10.1016/B978-1-4832-3187-7.50015-5

[7] SAHNI S, 1973, THESIS CORNELL U

[8] SPENCER JE, PRIVATE COMMUNICATIO

[9] WELSH DJA, 1967, COMPUT J, V10, P85

[10] A TECHNIQUE FOR COLOURING A GRAPH APPLICABLE TO LARGE SCALE TIMETABLING PROBLEMS [J]. COMPUTER JOURNAL, 1969, 12 (04) : 317 - &