Polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach

SIAM Journal on Computing

Volumn 17, Issue 3, 1988, Pages 539-551

  Hochbaum, Dorit S ^a   Shmoys, David B ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING--ALGORITHMS; MATHEMATICAL TECHNIQUES--APPROXIMATION THEORY; SCHEDULING;

MINIMUM MAKESPAN PROBLEM; POLYNOMIAL ALGORITHMS; POLYNOMIAL APPROXIMATION; UNIFORM PARALLEL PROCESSORS;

COMPUTER SYSTEMS, DIGITAL;

EID: 0024018137     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/0217033     Document Type: Article

References (9)