Approximability of scheduling with fixed jobs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 1999, Pages

  Scharbrodt, Mark ^a   Steger, Angelika ^a   Weisser, Horst ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; POLYNOMIALS;

STANDARD SCHEDULING PROBLEM;

ALGORITHMS;

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

References (4)