Fetching the paper…
Reading the bibliography…
We study a general class of PageRank optimization problems which consist in finding an optimal outlink strategy for a web site subject to design constraints.
C. H. Papadimitriou and J. N. Tsitsiklis, “The complexity of markov decision processes,” Mathematics of Operations Research , vol. 12, no. 3, pp. 441–450, 1987
1987
Earlier work this paper cites.
M. Groetschel, L. Lovász, and A. Schrijver, Geometric Algorithms and Combinatorial Optimization , ser. Algorithms and Combinatorics, R. L. Graham, B. Korte, and L. Lovasz, Eds. Springer-Verlag, 1988, vol. 2
1988
Earlier work this paper cites.
M. L. Puterman, Markov Decision Processes: Discrete Stochastic Dynamic Programming . John Wiley & Sons, Inc., 1994
1994
Earlier work this paper cites.
R. T. Rockafellar and R. J.-B. Wets, Variational Analysis , ser. Grundlehren der math. Wiss. Springer, 1997, vol. 317
1997
Earlier work this paper cites.
S. Brin and L. Page, “The anatomy of a large-scale hypertextual web search engine,” Computer Networks and ISDN Systems , vol. 30, no. 1-7, pp. 107–117, 1998, proc. 17th International World Wide Web Conference
1998
Earlier work this paper cites.
E. Altman, Constrained Markov decision processes , ser. Stochastic Modeling. Chapman & Hall/CRC, 1999
1999
Earlier work this paper cites.
R. Givan, S. Leach, and T. Dean, “Bounded-parameter markov decision processes,” Artificial Intelligence , vol. 122, no. 1-2, pp. 71–109, 2000
2000
Earlier work this paper cites.
W. T. Tutte, Graph theory , ser. Enc. of Mathematics and its Applications. Cambridge University Press, 2001, vol. 21
2001
Earlier work this paper cites.
G. M. Ziegler, Lectures on Polytopes (Graduate Texts in Mathematics) . Springer, 2001
2001
Earlier work this paper cites.
A. Ben-Tal and A. Nemirovski, Lectures on Modern Convex Optimization, Analysis, Algorithms and Engineering Applications , ser. MPS/SIAM Series on Optimization. SIAM, 2001
2001
Earlier work this paper cites.
C. Lemaréchal, “Lagrangian relaxation,” in Computational Combinatorial Optimization , M. Jünger and D. Naddef, Eds. Springer Verlag, Heidelberg, 2001, pp. 115–160
2001
Earlier work this paper cites.
A. Arasu, J. Novak, A. Tomkins, and J. Tomlin, “Pagerank computation and the structure of the web: Experiments and algorithms,” in Proc. 11th International Conference on World Wide Web, Alternate Poster Tracks , 2002
2002
Earlier work this paper cites.
J. A. Tomlin, “A new paradigm for ranking pages on the world wide web,” in Proc. 12th international conference on World Wide Web , ser. WWW ’03. New York, NY, USA: ACM, 2003, pp. 350–355
2003
Cited alongside, same era.
A. Bonato and W. Laurier, “A survey of models of the web graph,” in Proc. of Combinatorial and Algorithmic Aspects of Networking . Springer, 2004, pp. 159–172
2004
Cited alongside, same era.
F. Mathieu, “Graphes du web, mesures d’importance à la pagerank,” Ph.D. dissertation, Université Montpellier II, 2004
2004
Cited alongside, same era.
Z. Gyöngyi and H. Garcia-Molina, “Link spam alliances,” in VLDB ’05: Proc. 31st international conference on Very large data bases . VLDB Endowment, 2005, pp. 517–528
2005
Cited alongside, same era.
R. A. Baeza-Yates, C. Castillo, and V. López, “Pagerank increase under different collusion topologies,” in Proc. of the First International Workshop on Adversarial Information Retrieval on the Web , 2005, pp. 17–24
H.-F. Winkler and S. Vlasceanu, “Quelle est la valeur d’un hyperlien ?” Rapport d’Enseignement d’Approfondissement en Recherche Opérationnelle, Ecole Polytechnique, 2007
2007
Later among the works it cites.
C. de Kerchove, L. Ninove, and P. van Dooren, “Maximizing pagerank via outlinks,” Linear Algebra and its Applications , vol. 429, no. 5-6, pp. 1254–1276, 2008
2008
Later among the works it cites.
L. Ninove, “Dominant vectors of nonnegative matrices,” PhD Thesis, Université Catholique de Louvain, 2008
2008
Later among the works it cites.
D. Nemirovsky and K. Avrachenkov, “Weighted pagerank: Cluster-related weights,” in Proc. 17th Text REtrieval Conference, TREC’08 , E. M. Voorhees and L. P. Buckland, Eds. National Institute of Standards and Technology (NIST), 2008
2008
Later among the works it cites.
D. Chaffey, C. Lake, and A. Friedlein, Search Engine Optimization - Best Practice Guide . Econsultancy.com Ltd, 2009
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2005
Cited alongside, same era.
P. Berkhin, “A survey on pagerank computing,” Internet Mathematics , vol. 2, pp. 73–120, 2005
2005
Cited alongside, same era.
A. Borodin, G. O. Roberts, and J. S. Rosenthal, “Link analysis ranking: algorithms, theory, and experiments,” ACM Transactions on Internet Technology , vol. 5, pp. 231–297, 2005
2005
Cited alongside, same era.
A. N. Langville and C. D. Meyer, Google’s PageRank and beyond: the science of search engine rankings . Princeton University Press, 2006
2006
Cited alongside, same era.
K. Avrachenkov and N. Litvak, “The Effect of New Links on Google PageRank,” Stochastic Models , vol. 22, no. 2, pp. 319–331, 2006
2006
Cited alongside, same era.
F. Mathieu and L. Viennot, “Local aspects of the global ranking of web pages,” in 6th International Workshop on Innovative Internet Community Systems (I2CS) , Neuchâtel, 2006, pp. 1–10
2006
Cited alongside, same era.
B. Kveton, M. Hauskrecht, and C. Guestrin, “Solving factored mdps with hybrid state and action variables,” Journal of Artificial Intelligence Research , vol. 27, pp. 153–201, 2006
2006
Cited alongside, same era.
A. W. L. D. Project, “New zealand university web sites,” January 2006. [Online]. Available: http://cybermetrics.wlv.ac.uk/database/index.html
2006
Cited alongside, same era.
2009
Later among the works it cites.
A. Nazin and B. Polyak, “Adaptive randomized algorithm for finding eigenvector of stochastic matrix with application to pagerank,” in Proc. 48th IEEE Conference on Decision and Control (CDC/CCC) , 2009, pp. 127–132
2009
Later among the works it cites.
H. Ishii and R. Tempo, “Computing the pagerank variation for fragile web data,” SICE J. of Control, Measurement, and System Integration , vol. 2, no. 1, pp. 1–9, 2009
2009
Later among the works it cites.
——, “Pagerank optimization by edge selection,” 2009, eprint arXiv:0911.2280v1
2009
Later among the works it cites.
H. Ishii and R. Tempo, “Distributed randomized algorithms for the pagerank computation,” Automatic Control, IEEE Transactions on , vol. 55, no. 9, pp. 1987–2002, 2010
2010
Closest in time.
B. C. Csáji, R. M. Jungers, and V. D. Blondel, “Pagerank optimization in polynomial time by stochastic shortest path reformulation,” in Proc. 21st International Conference on Algorithmic Learning Theory , ser. Lecture Notes in Computer Science, vol. 6331. Springer, 2010, pp. 89–103
2010
Closest in time.
H. Xu and S. Mannor, “Distributionally robust markov decision processes,” in Advances in Neural Information Processing Systems 23 , J. Lafferty, C. K. I. Williams, J. Shawe-Taylor, R. Zemel, and A. Culotta, Eds., 2010, pp. 2505–2513
2010
Closest in time.