The closeness and the betweenness centralities are two well known measures of importance of a vertex within a given complex network. Having high closeness or betweenness centrality can have positive impact on the vertex itself: hence, in this paper we consider the problem of determining how much a vertex can increase its centrality by creating a limited amount of new edges incident to it. We first prove that this problem does not admit a polynomial-time approximation scheme (unless P = NP), and we then propose a simple greedy approximation algorithm (with an almost tight approximation ratio), whose performance is then tested on synthetic graphs and real-world networks.
CITATION STYLE
Crescenzi, P., D’Angelo, G., Severini, L., & Velaj, Y. (2015). Greedily improving our own centrality in a network. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9125, pp. 43–55). Springer Verlag. https://doi.org/10.1007/978-3-319-20086-6_4
Mendeley helps you to discover research relevant for your work.