New Approximation Algorithms for Forest Closeness Centrality - for Individual Vertices and Vertex Groups.
Alexander van der GrintenEugenio AngrimanMaria PredariHenning MeyerhenkePublished in: CoRR (2021)
Keyphrases
- approximation algorithms
- undirected graph
- np hard
- special case
- vertex cover
- minimum cost
- facility location problem
- network design problem
- group members
- worst case
- minimum weight
- betweenness centrality
- disjoint paths
- vertex set
- primal dual
- hamiltonian cycle
- randomized algorithms
- set cover
- approximation ratio
- social network analysis
- constant factor
- planar graphs
- constant factor approximation
- edge weights
- computational complexity
- individual level
- combinatorial auctions
- network analysis
- open shop
- lower bound
- optimal solution
- learning algorithm