A 5/4-approximation algorithm for scheduling identical malleable tasks.
Thomas DeckerThomas LückingBurkhard MonienPublished in: Theor. Comput. Sci. (2006)
Keyphrases
- improved algorithm
- preprocessing
- theoretical analysis
- optimal solution
- search space
- times faster
- detection algorithm
- worst case
- approximation ratio
- error bounds
- linear programming
- learning algorithm
- computationally efficient
- dynamic programming
- particle swarm optimization
- cost function
- k means
- expectation maximization
- segmentation algorithm
- ant colony optimization
- tree structure
- significant improvement
- similarity measure
- genetic algorithm