Erratum to "Inapproximability and Polynomial-Time Approximation Algorithm for UET Tasks on Structured Processor Networks".
Marwane BouznifRodolphe GiroudeauPublished in: Adv. Oper. Res. (2012)
Keyphrases
- polynomial time approximation
- approximation algorithms
- computational complexity
- np hard
- dynamic programming
- worst case
- learning algorithm
- convergence rate
- error bounds
- k means
- probabilistic model
- theoretical analysis
- linear programming
- vertex cover
- social networks
- segmentation algorithm
- objective function
- bin packing
- greedy algorithms
- bayesian networks