A tight linear time $$\frac{13}{12}$$ -approximation algorithm for the $$P2 || C_{\max }$$ problem.
Federico Della CroceRosario ScatamacchiaVincent T'kindtPublished in: J. Comb. Optim. (2019)
Keyphrases
- worst case
- computational cost
- experimental evaluation
- computational complexity
- dynamic programming
- error bounds
- times faster
- search space
- improved algorithm
- detection algorithm
- theoretical analysis
- approximation algorithms
- recognition algorithm
- piecewise constant
- high accuracy
- np hard
- cost function
- significant improvement
- k means
- preprocessing
- objective function
- constant factor
- approximation methods
- approximation ratio
- neural network
- randomized algorithm
- matching algorithm
- optimization algorithm
- computationally efficient
- particle swarm optimization
- special case
- bayesian networks
- learning algorithm