Maximizing Entanglement Routing Rate in Quantum Networks: Approximation Algorithms.
Tu N. NguyenDung H. P. NguyenDang H. PhamBing-Hong LiuHoa N. NguyenPublished in: CoRR (2022)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- network topologies
- minimum cost
- vertex cover
- network design problem
- set cover
- facility location problem
- open shop
- approximation schemes
- constant factor
- np hardness
- disjoint paths
- randomized algorithms
- approximation ratio
- polynomial time approximation
- routing protocol
- constant factor approximation
- lower bound
- undirected graph
- approximation guarantees
- combinatorial auctions
- routing algorithm
- ad hoc networks
- channel capacity
- wireless sensor networks