LP Relaxation-Based Approximation Algorithms for Maximizing Entangled Quantum Routing Rate.
Tu N. NguyenDung H. P. NguyenDang H. PhamBing-Hong LiuHoa N. NguyenPublished in: ICC (2022)
Keyphrases
- approximation algorithms
- lp relaxation
- integrality gap
- network design problem
- np hard
- linear programming
- special case
- integer programming
- message passing
- linear program
- optimal solution
- knapsack problem
- minimum cost
- worst case
- approximation ratio
- primal dual
- feasible solution
- routing problem
- shortest path
- exact algorithms
- linear programming relaxation
- np hardness
- constant factor
- integer programming formulation
- lower bound
- evolutionary algorithm
- valid inequalities
- energy minimization
- approximate solutions
- approximation guarantees
- branch and bound algorithm