4.6 Article

An efficient polynomial time approximation scheme for load balancing on uniformly related machines

相关参考文献

注意:仅列出部分参考文献,下载原文获取全部文献信息。
Article Computer Science, Theory & Methods

SERVER SCHEDULING TO BALANCE PRIORITIES, FAIRNESS, AND AVERAGE QUALITY OF SERVICE

Nikhil Bansal et al.

SIAM JOURNAL ON COMPUTING (2010)

Article Computer Science, Theory & Methods

Maximizing the minimum load for selfish agents

Leah Epstein et al.

THEORETICAL COMPUTER SCIENCE (2010)

Review Computer Science, Hardware & Architecture

Parameterized complexity and approximation algorithms

Daniel Marx

COMPUTER JOURNAL (2008)

Article Computer Science, Theory & Methods

Approximation schemes for scheduling and covering on unrelated machines

Pavlos S. Efraimidis et al.

THEORETICAL COMPUTER SCIENCE (2006)

Article Computer Science, Software Engineering

Approximation schemes for scheduling on uniformly related and identical parallel machines

L Epstein et al.

ALGORITHMICA (2004)

Article Computer Science, Theory & Methods

All-norm approximation algorithms

Y Azar et al.

JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC (2004)

Article Computer Science, Software Engineering

Ancient and new algorithms for load balancing in the lp norm

A Avidor et al.

ALGORITHMICA (2001)