A lower bound for weak Schur numbers with a deterministic algorithm.
Ghada Ben HassinePierre BergéArpad RimmelJoanna TomasikPublished in: J. Discrete Algorithms (2018)
Keyphrases
- cost function
- lower bound
- objective function
- np hard
- optimal solution
- preprocessing
- optimization algorithm
- dynamic programming
- high accuracy
- worst case
- learning algorithm
- detection algorithm
- theoretical analysis
- simulated annealing
- computational cost
- experimental evaluation
- significant improvement
- k means
- times faster
- average case
- computational complexity
- competitive ratio
- randomized algorithms
- relaxation algorithm
- particle swarm optimization
- neural network
- branch and bound algorithm
- randomized algorithm