A constant-factor approximation algorithm for the link building problem

Authors:
Martin Olsen;Anastasios Viglas;Ilia Zvedeniouk
Affiliations:
Center for Innovation and Business Development, Institute of Business and Technology, Aarhus University, Herning, Denmark;School of Information Technologies, University of Sydney, NSW, Australia;School of Information Technologies, University of Sydney, NSW, Australia
Venue:
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Year:
2010

Citing 3
Cited 3

The anatomy of a large-scale hypertextual Web search engine

WWW7 Proceedings of the seventh international conference on World Wide Web 7
Inside PageRank

ACM Transactions on Internet Technology (TOIT)
Maximizing pagerank with new backlinks

CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity

Verifying nash equilibria in pagerank games on undirected web graphs

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
On the approximability of the link building problem

Theoretical Computer Science
Reputation games for undirected graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.