A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Problem with Costs - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Eric Angel, Evripidis Bampis, Alexander Kononov. A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Problem with Costs. In Friedhelm Meyer auf der Heide, editor, Algorithms - ESA 2001, 9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001, Proceedings. Volume 2161 of Lecture Notes in Computer Science, pages 194-205, Springer, 2001. [doi]

This author has not been identified. Look up 'Eric Angel' in GoogleThis author has not been identified. Look up 'Evripidis Bampis' in GoogleThis author has not been identified. Look up 'Alexander Kononov' in Google

runs on WebDSL