IEICE Transactions on Information and Systems
Online ISSN : 1745-1361
Print ISSN : 0916-8532
Regular Section
An Efficient Approximate Algorithm for the 1-Median Problem on a Graph
Koji TABATAAtsuyoshi NAKAMURAMineichi KUDO
Author information

2017 Volume E100.D Issue 5 Pages 994-1002


We propose a heuristic approximation algorithm for the 1-median problem. The 1-median problem is the problem of finding a vertex with the highest closeness centrality. Starting from a randomly selected vertex, our algorithm repeats to find a vertex with higher closeness centrality by approximately calculating closeness centrality of each vertex using simpler spanning subgraphs, which are called k-neighbor dense shortest path graphs with shortcuts. According to our experimental results using real networks with more than 10,000 vertices, our algorithm is more than 100 times faster than the exhaustive search and more than 20 times faster than the state-of-the-art approximation algorithm using annotated information to the vertices while the solutions output by our algorithm have higher approximation ratio.

Content from these authors
© 2017 The Institute of Electronics, Information and Communication Engineers
Previous article Next article