An efficient linear programming rounding-and-refinement algorithm for large-scale network slicing problem.
Weikun ChenYa-Feng LiuYu-Hong DaiZhi-Quan LuoPublished in: CoRR (2021)
Keyphrases
- linear programming
- learning algorithm
- detection algorithm
- experimental evaluation
- computational cost
- dynamic programming
- high accuracy
- preprocessing
- k means
- significant improvement
- np hard
- times faster
- objective function
- segmentation algorithm
- computationally efficient
- linear program
- network flow
- worst case
- optimal solution
- simulated annealing
- probabilistic model
- cost function
- search space
- association rules
- computational complexity
- approximation algorithms
- primal dual
- similarity measure