Skip to Main content Skip to Navigation
Journal articles

Greedily Improving Our Own Closeness Centrality in a Network

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.
Document type :
Journal articles
Complete list of metadata

Cited literature [44 references]  Display  Hide  Download
Contributor : Marie-France Sagot Connect in order to contact the contributor
Submitted on : Thursday, June 29, 2017 - 11:11:12 AM
Last modification on : Monday, October 12, 2020 - 10:28:18 AM
Long-term archiving on: : Thursday, January 18, 2018 - 2:43:52 AM


Files produced by the author(s)







Pierluigi Crescenzi, Gianlorenzo d'Angelo, Lorenzo Severini, Yllka Velaj. Greedily Improving Our Own Closeness Centrality in a Network. ACM Transactions on Knowledge Discovery from Data (TKDD), ACM, 2016, 11 (1), pp.1-32. ⟨10.1145/2953882⟩. ⟨hal-01390134⟩



Record views


Files downloads