Affiliation:
1. University of Florence, Florence, Italy
2. Gran Sasso Science Institute, L'Aquila, Italy
Abstract
The closeness centrality is a well-known measure of importance of a vertex within a given complex network. Having high closeness centrality can have positive impact on the vertex itself: hence, in this paper we consider the optimization problem of determining how much a vertex can increase its centrality by creating a limited amount of new edges incident to it. We will consider both the undirected and the directed graph cases. In both cases, we first prove that the optimization problem does not admit a polynomial-time approximation scheme (unless
P
=
NP
), and then propose a greedy approximation algorithm (with an almost tight approximation ratio), whose performance is then tested on synthetic graphs and real-world networks.
Funder
14th International Symposium on Experimental Algorithms
Publisher
Association for Computing Machinery (ACM)
Reference49 articles.
1. Arnetminer. Accessed January 15 2015 from http://arnetminer.org. Arnetminer. Accessed January 15 2015 from http://arnetminer.org.
2. The Effect of New Links on Google Pagerank
3. Supervised random walks
4. The Shortcut Problem - Complexity and Algorithms
Cited by
50 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献