An Improved Approximation Algorithm for Scheduling Task Trees on Linear Arrays.
Hari Krishna TadepalliErrol L. LloydPublished in: IPPS (1996)
Keyphrases
- experimental evaluation
- optimization algorithm
- computational cost
- optimal solution
- worst case
- np hard
- tree structure
- linear complexity
- dynamic programming
- search space
- preprocessing
- cost function
- randomized algorithm
- detection algorithm
- scheduling strategy
- linear systems
- list scheduling
- segmentation algorithm
- convex hull
- theoretical analysis
- k means
- objective function
- error bounds
- convergence rate
- decision trees
- polygonal approximation
- simulated annealing
- linear approximation