New Approximation Algorithms for Forest Closeness Centrality - for Individual Vertices and Vertex Groups.
Alexander van der GrintenEugenio AngrimanMaria PredariHenning MeyerhenkePublished in: SDM (2021)
Keyphrases
- approximation algorithms
- undirected graph
- np hard
- special case
- minimum cost
- worst case
- group members
- randomized algorithms
- disjoint paths
- vertex cover
- minimum weight
- approximation ratio
- primal dual
- network design problem
- betweenness centrality
- set cover
- attributed graphs
- social networks
- facility location problem
- constant factor
- combinatorial auctions
- np hardness
- open shop
- directed graph
- hamiltonian cycle
- constant factor approximation
- precedence constraints
- polynomial time approximation
- integer programming
- greedy algorithm
- social network analysis
- computational complexity
- optimal solution