Approximability of scheduling with fixed jobs

Authors:
Mark Scharbrodt;Angelika Steger;Horst Weisser
Affiliations:
Lehrstuhl für Brauereianlagen und Lebensmittel-Verpackungstechnik, Technische Universität München in Weihenstephan, D-85350 Feising-Weihenstephan, Germany;Institut für Informatik, Technische Universität München, D-80290 München, Germany;Lehrstuhl für Brauereianlagen und Lebensmittel-Verpackungstechnik, Technische Universität München in Weihenstephan, D-85350 Feising-Weihenstephan, Germany
Venue:
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Year:
1999

Parameterized approximation scheme for the multiple knapsack problem

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Improved approximation algorithms for scheduling with fixed jobs

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Parameterized Approximation Scheme for the Multiple Knapsack Problem

SIAM Journal on Computing
Faster approximation algorithms for scheduling with fixed jobs

CATS '11 Proceedings of the Seventeenth Computing: The Australasian Theory Symposium - Volume 119
Faster approximation algorithms for scheduling with fixed jobs

CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119

Hi-index	0.00