An Efficient Linear Programming Rounding-and-Refinement Algorithm for Large-Scale Network Slicing Problem.
Weikun ChenYa-Feng LiuYu-Hong DaiZhi-Quan LuoPublished in: ICASSP (2021)
Keyphrases
- linear programming
- dynamic programming
- cost function
- objective function
- np hard
- detection algorithm
- computationally efficient
- experimental evaluation
- primal dual
- preprocessing
- computational complexity
- worst case
- high accuracy
- optimal solution
- learning algorithm
- k means
- neural network
- matching algorithm
- growing neural gas
- linear programming relaxation
- convergence rate
- convex hull
- times faster
- optimization algorithm
- segmentation algorithm
- expectation maximization
- peer to peer
- optimization problems
- simulated annealing
- search space