A polynomial time algorithm for a variant of shortest vector problem with applications in compute-and-forward design.
Chao TongJun LiJinming WenPublished in: Clust. Comput. (2019)
Keyphrases
- computational complexity
- worst case
- dynamic programming
- k means
- experimental evaluation
- optimization algorithm
- high accuracy
- times faster
- linear programming
- matching algorithm
- preprocessing
- cost function
- particle swarm optimization
- learning algorithm
- theoretical analysis
- computational cost
- space complexity
- approximation ratio
- np hard
- significant improvement
- objective function
- np complete
- optimal solution
- design process
- ant colony optimization
- similarity measure
- case study
- decision trees