Polynomial time approximation scheme for general multiprocessor job scheduling

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1999, Pages 418-427

  Chen, Jianer ^a   Miranda, Antonio ^a  

^a TEXAS A AND M UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; PARALLEL ALGORITHMS; POLYNOMIALS; SCHEDULING;

GOEMAN ALGORITHM; MULTIPROCESSOR JOB SCHEDULING; POLYNOMIAL TIME APPROXIMATION;

COMPUTATIONAL COMPLEXITY;

EID: 0032662403     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Article

References (25)