{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:29:28Z","timestamp":1725488968512},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540699941"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69995-8_29","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T16:28:21Z","timestamp":1186763301000},"page":"175-179","source":"Crossref","is-referenced-by-count":0,"title":["On Asymptotically Optimal Algorithm for One Modification of Planar 3-dimensional Assignment Problem"],"prefix":"10.1007","author":[{"given":"Yury","family":"Glazkov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0377-2217(83)90078-4","volume":"13","author":"A. Frieze","year":"1983","unstructured":"Frieze A (1983) Complexity of a 3-dimensional assignment problem. European J. Oper. Res. V 13, N 2: 161\u2013164.","journal-title":"European J. Oper. Res."},{"key":"29_CR2","unstructured":"Gimadi E (2005) On some probability inequalities in some discrete optimization problems. \/\/ Operation Research Proceedings 2005, to appear in 2006."},{"key":"29_CR3","unstructured":"Gimadi E, Korkishko N (2004) On some modifications of three index planar assignment problem \/\/ Discrete optimization methods in production and logistics. The second int. workshop (Omsk, July 20\u201327, 2004). Proc. DOM\u20192004, Omsk, 2004. P. 161\u2013165."},{"issue":"4","key":"29_CR4","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J. Hopcroft","year":"1973","unstructured":"Hopcroft J, Karp R (1973) An n\n                  5\/2 algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. V. 2, N 4: 225\u2013231.","journal-title":"SIAM J. Comput."},{"key":"29_CR5","first-page":"342","volume":"41","author":"M. Kravtsov","year":"2001","unstructured":"Kravtsov M, Krachkovskii A (2001) O polinomialnom algoritme nahozhdeniia asimptoticheski optimalnogo resheniia trehindeksnoi planarnoi problemi vibora. Zhurnal vichislitelnoi matematiki i matematicheskoi fiziki T. 41, \u00fc 2: 342\u2013345.","journal-title":"Zhurnal vichislitelnoi matematiki i matematicheskoi fiziki"},{"key":"29_CR6","volume-title":"Teoriia grafov","author":"O. Ore","year":"1980","unstructured":"Ore O (1980) Teoriia grafov. Nauka, Moskva"},{"key":"29_CR7","volume-title":"Predelnie teoremi dlia summ nezavisimih sluchainih velichin","author":"V. Petrov","year":"1987","unstructured":"Petrov V (1987) Predelnie teoremi dlia summ nezavisimih sluchainih velichin. Nauka, Moskva"},{"key":"29_CR8","first-page":"3","volume":"8","author":"I. Vozniuk","year":"2001","unstructured":"Vozniuk I, Gimadi E, Fialtov M (2001) Asimptoticheski tochnii algoritm dlia resheniia zadachi razmesheniia s ogranichennimi obiemami proizvodstva. Diskretnii analiz i issledovanie operatsii Ser. 2. T. 8, \u00fc 2:3\u201316.","journal-title":"Diskretnii analiz i issledovanie operatsii Ser. 2"}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2006"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69995-8_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:06:10Z","timestamp":1605762370000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69995-8_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540699941"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69995-8_29","relation":{},"subject":[]}}