In this work we consider the problem of maximizing the PageRank of a given target node in a graph by adding k new links. We consider the case that the new links must point to the given target node (backlinks). Previous work [7] shows that this problem has no fully polynomial time approximation schemes unless P = NP. We present a polynomial time algorithm yielding a PageRank value within a constant factor from the optimal. We also consider the naive algorithm where we choose backlinks from nodes with high PageRank values compared to the outdegree and show that the naive algorithm performs much worse on certain graphs compared to the constant factor approximation scheme. © 2010 Springer-Verlag.
CITATION STYLE
Olsen, M., Viglas, A., & Zvedeniouk, I. (2010). A constant-factor approximation algorithm for the link building problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6509 LNCS, pp. 87–96). https://doi.org/10.1007/978-3-642-17461-2_7
Mendeley helps you to discover research relevant for your work.