APPROXIMATION ALGORITHMS FOR COMBINATORIAL PROBLEMS

被引:1217
作者
JOHNSON, DS [1 ]
机构
[1] MIT,PROJECT MAC,CAMBRIDGE,MA 02139
关键词
D O I
10.1016/S0022-0000(74)80044-9
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:256 / 278
页数:23
相关论文
共 11 条
[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].
WOOD, DC .
COMPUTER JOURNAL, 1969, 12 (04) :317-&