Approximation techniques for average completion time scheduling

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 1997, Pages 609-618

  Chekuri, C ^a   Motwani, R ^a   Natarajan, B ^a   Stein, C ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; LINEAR PROGRAMMING; PARALLEL ALGORITHMS; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; SCHEDULING; THEOREM PROVING; TREES (MATHEMATICS);

APPROXIMATION ALGORITHMS; AVERAGE COMPLETION TIME SCHEDULING; LINEAR PROGRAMMING RELAXATION;

APPROXIMATION THEORY;

EID: 0030835059     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)