{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:57:11Z","timestamp":1725562631115},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540221135"},{"type":"electronic","value":"9783540259602"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-25960-2_6","type":"book-chapter","created":{"date-parts":[[2010,8,8]],"date-time":"2010-08-08T23:21:46Z","timestamp":1281309706000},"page":"74-85","source":"Crossref","is-referenced-by-count":4,"title":["Polynomial Time Algorithm for Determining Optimal Strategies in Cyclic Games"],"prefix":"10.1007","author":[{"given":"Dmitrii","family":"Lozovanu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Ehrenfeucht, A., Mycielski, J.: Positional strategies for mean payoff games. International Journal of Game Theory\u00a0(8), 109\u2013113 (1979)","DOI":"10.1007\/BF01768705"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Gurvich, V.A., Karzanov, A.V., Khachiyan, L.G.: Cyclic games and an algorithm to find minmax cycle means in directed graphs. USSR, Computational Mathematics and Mathematical Physics\u00a0(28), 85\u201391 (1988)","DOI":"10.1016\/0041-5553(88)90012-2"},{"key":"6_CR3","volume-title":"Extremal-Combinatorial problems and algorithms for its solving","author":"D.D. Lozovanu","year":"1991","unstructured":"Lozovanu, D.D.: Extremal-Combinatorial problems and algorithms for its solving. Kishinev, Stiinta (1991)"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1016\/0304-3975(95)00188-3","volume":"158","author":"U. Zwick","year":"1996","unstructured":"Zwick, U., Paterson, M.: The complexity of mean payoff games on graphs. TCS\u00a0158, 344\u2013359 (1996)","journal-title":"TCS"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Lozovanu, D.D.: Algorithms to solve some classes of network minmax problems and their applications. Cybernetics\u00a0(29), 93\u2013100 (1991)","DOI":"10.1007\/BF01068651"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Lozovanu, D.D.: Strongly polynomial algorithms for finding minimax paths in networks and solution of cyclic games. Cybernetics and Systems Analysis\u00a0(29), 754\u2013759 (1993)","DOI":"10.1007\/BF01125805"},{"key":"6_CR7","unstructured":"Lozovanu, D.D., Trubin, V.A.: Min-max path problem on network and an algorithm for its solving. Discrete Mathematics and Applications\u00a0(6), 138\u2013144 (1994)"},{"issue":"1-3","key":"6_CR8","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/S0166-218X(99)00144-4","volume":"99","author":"R. Boliac","year":"2000","unstructured":"Boliac, R., Lozovanu, D., Solomon, D.: Optimal paths in network games with p players. Discrete Applied Mathematics\u00a099(1-3), 339\u2013348 (2000)","journal-title":"Discrete Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-25960-2_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T17:52:06Z","timestamp":1685728326000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-25960-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540221135","9783540259602"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-25960-2_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}