Inapproximability and Polynomial-Time Approximation Algorithm for UET Tasks on Structured Processor Networks.
Marwane BouznifRodolphe GiroudeauPublished in: Adv. Oper. Res. (2011)
Keyphrases
- polynomial time approximation
- detection algorithm
- learning algorithm
- computational complexity
- np hard
- simulated annealing
- dynamic programming
- worst case
- bin packing
- search space
- linear programming
- approximation algorithms
- vertex cover
- integer programming
- error bounds
- tree structure
- segmentation algorithm
- search algorithm
- objective function