On Gaussian Approximation Algorithms for SCMA.
Xiaotian FuMylene PischellaDidier Le RuyetPublished in: ISWCS (2019)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- vertex cover
- facility location problem
- minimum cost
- approximation ratio
- primal dual
- randomized algorithms
- open shop
- network design problem
- exact algorithms
- constant factor
- approximation schemes
- set cover
- disjoint paths
- maximum likelihood
- lower bound
- np hardness
- precedence constraints
- undirected graph
- combinatorial auctions
- metaheuristic
- computational complexity