Scalability of Betweenness Approximation Algorithms: An Experimental Review.
Sebastian WandeltXing ShiXiaoqian SunPublished in: IEEE Access (2019)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- minimum cost
- network design problem
- set cover
- vertex cover
- approximation ratio
- facility location problem
- np hardness
- exact algorithms
- social network analysis
- complex networks
- combinatorial auctions
- approximation schemes
- disjoint paths
- constant factor approximation
- randomized algorithms
- constant factor
- precedence constraints
- primal dual
- open shop
- linear programming
- computational complexity