Top-k overlapping densest subgraphs: approximation algorithms and computational complexity.
Riccardo DondiMohammad Mehdi HosseinzadehGiancarlo MauriItalo ZoppisPublished in: J. Comb. Optim. (2021)
Keyphrases
- approximation algorithms
- computational complexity
- np hard
- special case
- graph mining
- worst case
- dense subgraphs
- np complete
- minimum cost
- query processing
- approximation schemes
- facility location problem
- vertex cover
- set cover
- np hardness
- primal dual
- approximation ratio
- open shop
- optimal solution
- lower bound
- network design problem
- constant factor
- randomized algorithms
- integer programming
- disjoint paths
- linear programming
- scheduling problem
- undirected graph
- functional modules
- precedence constraints
- scoring function
- pattern mining
- linear program
- link prediction
- constant factor approximation