{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T03:12:35Z","timestamp":1768446755587,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642161070","type":"print"},{"value":"9783642161087","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16108-7_11","type":"book-chapter","created":{"date-parts":[[2010,8,31]],"date-time":"2010-08-31T12:58:37Z","timestamp":1283259517000},"page":"89-103","source":"Crossref","is-referenced-by-count":11,"title":["PageRank Optimization in Polynomial Time by Stochastic Shortest Path Reformulation"],"prefix":"10.1007","author":[{"given":"Bal\u00e1zs Csan\u00e1d","family":"Cs\u00e1ji","sequence":"first","affiliation":[]},{"given":"Rapha\u00ebl M.","family":"Jungers","sequence":"additional","affiliation":[]},{"given":"Vincent D.","family":"Blondel","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1080\/15326340600649052","volume":"22","author":"K. Avrachenkov","year":"2006","unstructured":"Avrachenkov, K., Litvak, N.: The effect of new links on Google PageRank. Stochastic Models\u00a022, 319\u2013331 (2006)","journal-title":"Stochastic Models"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Berkhin, P.: A survey on PageRank computing. Internet Math. pp. 73\u2013120 (2005)","DOI":"10.1080\/15427951.2005.10129098"},{"key":"11_CR3","volume-title":"Neuro-Dynamic Programming","author":"D.P. Bertsekas","year":"1996","unstructured":"Bertsekas, D.P., Tsitsiklis, J.N.: Neuro-Dynamic Programming. Athena Scientific, Belmont (1996)"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Brin, S., Page, L.: The anatomy of a large-scale hypertextual web search engine. In: Proc. of the 7th Intern. Conf. on World Wide Web, pp. 107\u2013117 (1998)","DOI":"10.1016\/S0169-7552(98)00110-X"},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"1254","DOI":"10.1016\/j.laa.2008.01.023","volume":"429","author":"C. Kerchove De","year":"2008","unstructured":"De Kerchove, C., Ninove, L., Van Dooren, P.: Maximizing PageRank via outlinks. Linear Algebra and its Applications\u00a0429, 1254\u20131276 (2008)","journal-title":"Linear Algebra and its Applications"},{"key":"11_CR6","volume-title":"Handbook of Markov Decision Processes: Methods and Applications","year":"2002","unstructured":"Feinberg, E.A., Shwartz, A. (eds.): Handbook of Markov Decision Processes: Methods and Applications. Kluwer Academic Publishers, Dordrecht (2002)"},{"key":"11_CR7","volume-title":"Computers and Intractability; A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1990","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1990)"},{"key":"11_CR8","first-page":"1","volume-title":"Progress in Mathematical Programming: Interior-Point and Related Methods","author":"C.C. Gonzaga","year":"1988","unstructured":"Gonzaga, C.C.: An Algorithm for Solving Linear Programming Problems in O(n 3 L) operations. In: Progress in Mathematical Programming: Interior-Point and Related Methods, pp. 1\u201328. Springer, Heidelberg (1988)"},{"issue":"1","key":"11_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.9746\/jcmsi.2.1","volume":"2","author":"H. Ishii","year":"2009","unstructured":"Ishii, H., Tempo, R.: Computing the PageRank variation for fragile web data. SICE J. of Control, Measurement, and System Integration\u00a02(1), 1\u20139 (2009)","journal-title":"SICE J. of Control, Measurement, and System Integration"},{"key":"11_CR10","doi-asserted-by":"crossref","DOI":"10.1515\/9781400830329","volume-title":"Google\u2019s PageRank and Beyond: The Science of Search Engine Rankings","author":"A.N. Langville","year":"2006","unstructured":"Langville, A.N., Meyer, C.D.: Google\u2019s PageRank and Beyond: The Science of Search Engine Rankings. Princeton University Press, Princeton (2006)"},{"key":"11_CR11","volume-title":"Markov Chains and Mixing Times","author":"D.A. Levin","year":"2009","unstructured":"Levin, D.A., Peres, Y., Wilmer, E.L.: Markov Chains and Mixing Times. American Mathematical Society, Providence (2009)"},{"key":"11_CR12","unstructured":"Littman, M.L., Dean, T.L., Kaelbling, L.P.: On the complexity of solving Markov decision problems. In: Proc. of the Eleventh International Conference on Uncertainty in Artificial Intelligence, pp. 394\u2013402 (1995)"},{"key":"11_CR13","first-page":"348","volume-title":"Combinatorics: Paul Erd\u0151s is Eighty","author":"L. Lov\u00e1sz","year":"1996","unstructured":"Lov\u00e1sz, L.: Random walks on graphs: A survey. In: Combinatorics: Paul Erd\u0151s is Eighty, vol.\u00a02, pp. 348\u2013353. Bolyai Society Mathematical Studies, Budapest (1996)"},{"issue":"3","key":"11_CR14","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1287\/moor.12.3.441","volume":"12","author":"C.H. Papadimitriou","year":"1987","unstructured":"Papadimitriou, C.H., Tsitsiklis, J.N.: The complexity of Markov decision processes. Mathematics of Operations Research\u00a012(3), 441\u2013450 (1987)","journal-title":"Mathematics of Operations Research"},{"key":"11_CR15","volume-title":"Reinforcement learning","author":"R.S. Sutton","year":"1998","unstructured":"Sutton, R.S., Barto, A.G.: Reinforcement learning. MIT Press, Cambridge (1998)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16108-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,11]],"date-time":"2020-06-11T02:27:57Z","timestamp":1591842477000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16108-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642161070","9783642161087"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16108-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}