Group-Harmonic and Group-Closeness Maximization – Approximation and Engineering

10/29/2020
by   Eugenio Angriman, et al.
0

Centrality measures characterize important nodes in networks. Efficiently computing such nodes has received a lot of attention. When considering the generalization of computing central groups of nodes, challenging optimization problems occur. In this work, we study two such problems, group-harmonic maximization and group-closeness maximization both from a theoretical and from an algorithm engineering perspective. On the theoretical side, we obtain the following results. For group-harmonic maximization, unless P=NP, there is no polynomial-time algorithm that achieves an approximation factor better than 1-1/e (directed) and 1-1/(4e) (undirected), even for unweighted graphs. On the positive side, we show that a greedy algorithm achieves an approximation factor of λ(1-2/e) (directed) and λ(1-1/e)/2 (undirected), where λ is the ratio of minimal and maximal edge weights. For group-closeness maximization, the undirected case is NP-hard to be approximated to within a factor better than 1-1/(e+1) and a constant approximation factor is achieved by a local-search algorithm. For the directed case, however, we show that, for any ϵ<1/2, the problem is NP-hard to be approximated within a factor of 4|V|^-ϵ. From the algorithm engineering perspective, we provide efficient implementations of the above greedy and local search algorithms. In our experimental study we show that, on small instances where an optimum solution can be computed in reasonable time, the quality of both the greedy and the local search algorithms come very close to the optimum. On larger instances, our local search algorithms yield results with superior quality compared to existing greedy and local search solutions, at the cost of additional running time. We thus advocate local search for scenarios where solution quality is of highest concern.

READ FULL TEXT
research
11/08/2019

Local Search for Group Closeness Maximization on Big Graphs

In network analysis and graph mining, closeness centrality is a popular ...
research
11/11/2018

Coverage Centrality Maximization in Undirected Networks

Centrality metrics are among the main tools in social network analysis. ...
research
04/16/2017

A Hybrid ACO Algorithm for the Next Release Problem

In this paper, we propose a Hybrid Ant Colony Optimization algorithm (HA...
research
09/07/2022

A Local Search Algorithm for the Min-Sum Submodular Cover Problem

We consider the problem of solving the Min-Sum Submodular Cover problem ...
research
02/26/2020

Limitations of Greed: Influence Maximization in Undirected Networks Re-visited

We consider the influence maximization problem (selecting k seeds in a n...
research
12/07/2016

Re-identification of Humans in Crowds using Personal, Social and Environmental Constraints

This paper addresses the problem of human re-identification across non-o...
research
07/06/2019

Composable Core-sets for Determinant Maximization: A Simple Near-Optimal Algorithm

"Composable core-sets" are an efficient framework for solving optimizati...

Please sign up or login with your details

Forgot password? Click here to reset