Exact and superpolynomial approximation algorithms for the densest k-subgraph problem.
Nicolas BourgeoisAristotelis GiannakosGiorgio LucarelliIoannis MilisVangelis Th. PaschosPublished in: Eur. J. Oper. Res. (2017)
Keyphrases
- approximation algorithms
- np hard
- graph mining
- similarity graph
- special case
- dense subgraphs
- vertex cover
- minimum cost
- network design problem
- approximation ratio
- worst case
- constant factor
- open shop
- primal dual
- exact algorithms
- facility location problem
- scheduling problem
- pattern mining
- approximation schemes
- learning algorithm
- lower bound
- greedy heuristic
- np hardness
- set cover
- undirected graph
- combinatorial auctions
- integer programming
- knapsack problem
- linear programming
- optimal solution