DOES RANDOMIZATION HELP IN ONLINE BIN PACKING

被引：6

作者：

CHANDRA, B

机构：

[1] Department of Computer Science, University of Chicago, Chicago

来源：

关键词：

ANALYSIS OF ALGORITHMS; ONLINE ALGORITHMS; COMPETITIVE ANALYSIS; BIN PACKING; RANDOMIZATION;

D O I：

10.1016/0020-0190(92)90023-O

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

[No abstract available]

引用

页码：15 / 19

页数：5

共 6 条

COPPERSMITH, D ;

RAGHAVAN, P .

[2] PARAMETRIC LOWER BOUND FOR ONLINE BIN-PACKING [J].

GALAMBOS, G .

SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1986, 7 (03) :362-367

[3]

Galambos G., 1991, Acta Cybernetica, V10, P21

[4] A LOWER BOUND FOR ONLINE BIN PACKING [J].

LIANG, FM .

[5] ONLINE BIN PACKING IN LINEAR TIME [J].

RAMANAN, P ;

BROWN, DJ ;

LEE, CC ;

LEE, DT .

[6] NEW ALGORITHMS FOR BIN PACKING [J].

YAO, ACC .