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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Avrachenkov, K., Litvak, N.: The effect of new links on Google PageRank. Stochastic Models 22(2), 319–331 (2006)
Bianchini, M., Gori, M., Scarselli, F.: Inside pagerank. ACM Transactions on Internet Technology 5(1), 92–128 (2005)
Brin, S., Page, L.: The anatomy of a large-scale hypertextual Web search engine. Computer Networks and ISDN Systems 30(1-7), 107–117 (1998)
Dekerchove, C., Ninove, L., Vandooren, P.: Maximizing PageRank via outlinks. Linear Algebra and its Applications 429(5-6), 1254–1276 (2008)
Langville, A., Meyer, C.: Deeper inside pagerank. Internet Mathematics 1(3), 335–380 (2004)
Nemhauser, G., Wolsey, L., Fisher, M.: An analysis of approximations for maximizing submodular set functionsI. Mathematical Programming 14(1), 265–294 (1978)
Olsen, M.: Maximizing PageRank with New Backlinks. In: Calamoneri, T., Diaz, J. (eds.) Algorithms and Complexity. LNCS, vol. 6078, pp. 37–48. Springer, Heidelberg (2010)
Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank citation ranking: Bringing order to the web. Technical Report 1999-66, Stanford InfoLab (November 1999), http://ilpubs.stanford.edu:8090/422/
SEOmoz: Search engine 2009 ranking factors (2009), http://www.seomoz.org/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Olsen, M., Viglas, A., Zvedeniouk, I. (2010). A Constant-Factor Approximation Algorithm for the Link Building Problem. In: Wu, W., Daescu, O. (eds) Combinatorial Optimization and Applications. COCOA 2010. Lecture Notes in Computer Science, vol 6509. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17461-2_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-17461-2_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17460-5
Online ISBN: 978-3-642-17461-2
eBook Packages: Computer ScienceComputer Science (R0)