PARALLEL APPROXIMATION ALGORITHMS FOR BIN PACKING

被引：23

作者：

ANDERSON, RJ

MAYR, EW

WARMUTH, MK

机构：

[1] STANFORD UNIV,DEPT COMP SCI,STANFORD,CA 94305

[2] UNIV CALIF SANTA CRUZ,DEPT COMP SCI,SANTA CRUZ,CA 95064

来源：

关键词：

D O I：

10.1016/0890-5401(89)90003-5

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：262 / 277

页数：16

共 16 条

[1] A NEW PROOF FOR THE 1ST-FIT DECREASING BIN-PACKING ALGORITHM
BAKER, BS
[J]. JOURNAL OF ALGORITHMS, 1985, 6 (01) : 49 - 70
[2] OPTIMAL PARALLEL GENERATION OF A COMPUTATION TREE FORM
BARON, I
VISHKIN, U
[J]. ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1985, 7 (02): : 348 - 357
[3] DELAVEGA WF, 1981, COMBINATORICA, V1, P349
[4] LINEAR-PROGRAMMING IS LOG-SPACE HARD FOR P
DOBKIN, D
LIPTON, RJ
REISS, S
[J]. INFORMATION PROCESSING LETTERS, 1979, 8 (02) : 96 - 97
[5] THE MAXIMUM FLOW PROBLEM IS LOG SPACE COMPLETE FOR P
GOLDSCHLAGER, LM
SHAW, RA
STAPLES, J
[J]. THEORETICAL COMPUTER SCIENCE, 1982, 21 (01) : 105 - 111
[6] HELMHOLD D, 1987, ADV COMPUTING RES PA, P39
[7] Johnson D. S., 1974, SIAM Journal on Computing, V3, P299, DOI 10.1137/0203025
[8] Karmarkar N., 1982, 23rd Annual Symposium on Foundations of Computer Science, P312, DOI 10.1109/SFCS.1982.61
[9] KARP RM, 1985, 17TH P ANN ACM S THE, P22
[10] LADNER R, 1980, ASS COMPUT MACH, V27, P831