Approximation algorithms for min-max and max-min resource sharing problems, and applications

被引:10
作者
Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität zu Kiel, Olshausenstr. 40, 24098 Kiel, Germany [1 ]
机构
[1] Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität zu Kiel, 24098 Kiel
来源
Lect. Notes Comput. Sci. | 2006年 / 156-202期
关键词
D O I
10.1007/11671541_6
中图分类号
学科分类号
摘要
[No abstract available]
引用
收藏
页码:156 / 202
页数:46
相关论文
共 36 条
[1]  
Aigner M., Ziegler G.M., Proofs from THE BOOK, (1999)
[2]  
Amoura A.K., Bampis E., Kenyon C., Manoussakis Y., Scheduling independent multiprocessor tasks, Algorithmica, 32, pp. 247-261, (2002)
[3]  
Baker B., Coffman E., Rivest R., Orthogonal packings in two dimensions, SIAM Journal on Computing, 9, pp. 846-855, (1980)
[4]  
Bienstock D., Potential function methods for approximately solving linear programming problems: Theory and practice, (2002)
[5]  
Blazewicz J., Ecker K.H., Pesch E., Schmidt G., Weglarz J., Scheduling in Computer and Manufacturing Systems, (1996)
[6]  
Coffman E., Garey M., Johnson D., Tarjan R., Performance bounds for level-oriented two dimensional packing algorithms, SIAM Journal on Computing, 9, pp. 808-826, (1980)
[7]  
Chen G.I., Lai T.H., Scheduling independent jobs on hypercubes, LNCS, 294, pp. 273-280, (1988)
[8]  
de la Vega W.F., Lueker C.S., Bin packing can be solved within 1 + ε in linear time, Combinatorica, 1, pp. 349-355, (1981)
[9]  
Drozdowski M., Scheduling multiprocessor tasks - an overview, European Journal on Operations Research, 94, pp. 215-230, (1996)
[10]  
Du J., Leung J., Complexity of scheduling parallel task systems, SIAM Journal on Discrete Mathematics, 2, pp. 473-487, (1989)