乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,3]],"date-time":"2024-07-03T23:58:24Z","timestamp":1720051104201},"reference-count":17,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2014,12,1]],"date-time":"2014-12-01T00:00:00Z","timestamp":1417392000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":1492,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2014,12]]},"DOI":"10.1016\/j.dam.2014.03.011","type":"journal-article","created":{"date-parts":[[2014,3,28]],"date-time":"2014-03-28T16:39:13Z","timestamp":1396024753000},"page":"44-53","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["The Cyclic Towers of Antwerpen problem\u2014A challenging Hanoi variant"],"prefix":"10.1016","volume":"179","author":[{"given":"Steven","family":"Minsker","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.dam.2014.03.011_br000005","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/0020-0190(81)90123-X","article-title":"The cyclic towers of Hanoi","volume":"13","author":"Atkinson","year":"1981","journal-title":"Inform. Process. Lett."},{"issue":"3","key":"10.1016\/j.dam.2014.03.011_br000010","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1145\/1159892.1159893","article-title":"The cyclic multi-peg tower of Hanoi","volume":"2","author":"Berend","year":"2006","journal-title":"ACM Trans. Algorithms"},{"issue":"10\u201311","key":"10.1016\/j.dam.2014.03.011_br000015","doi-asserted-by":"crossref","first-page":"1465","DOI":"10.1016\/j.dam.2012.02.007","article-title":"The tower of Hanoi problem on pathh graphs","volume":"160","author":"Berend","year":"2012","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2014.03.011_br000020","series-title":"On Optimal Solutions to the Bottleneck Tower of Hanoi Problem","first-page":"248","volume":"vol. 4362","author":"Dinitz","year":"2007"},{"issue":"3","key":"10.1016\/j.dam.2014.03.011_br000025","doi-asserted-by":"crossref","DOI":"10.1145\/1367064.1367065","article-title":"Optimality of an algorithm solving the bottleneck tower of Hanoi Problem","volume":"4","author":"Dinitz","year":"2008","journal-title":"ACM Trans. Algorithms"},{"key":"10.1016\/j.dam.2014.03.011_br000030","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1080\/00207168408803406","article-title":"A generalization of the cyclic towers of Hanoi: an iterative solution","volume":"15","author":"Er","year":"1984","journal-title":"Int. J. Comput. Math."},{"issue":"3","key":"10.1016\/j.dam.2014.03.011_br000035","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1093\/comjnl\/27.3.278","article-title":"The generalized colour towers of Hanoi: an iterative algorithm","volume":"27","author":"Er","year":"1984","journal-title":"Comput. J."},{"key":"10.1016\/j.dam.2014.03.011_br000040","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/0196-6774(85)90004-5","article-title":"The complexity of the generalised cyclic towers of Hanoi problem","volume":"6","author":"Er","year":"1985","journal-title":"J. Algorithms"},{"issue":"1","key":"10.1016\/j.dam.2014.03.011_br000045","first-page":"87","article-title":"Towers of Hanoi with black and white discs","volume":"6","author":"Er","year":"1985","journal-title":"J. Inf. Optim. Sci."},{"key":"10.1016\/j.dam.2014.03.011_br000050","series-title":"The Tower of Hanoi\u2014Myths and Maths","author":"Hinz","year":"2013"},{"issue":"2","key":"10.1016\/j.dam.2014.03.011_br000055","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0020-0190(91)90230-F","article-title":"The towers of Antwerpen problem","volume":"38","author":"Minsker","year":"1991","journal-title":"Inform. Process. Lett."},{"issue":"5","key":"10.1016\/j.dam.2014.03.011_br000060","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/j.ipl.2005.02.007","article-title":"The little towers of Antwerpen problem","volume":"94","author":"Minsker","year":"2005","journal-title":"Inform. Process. Lett."},{"issue":"4","key":"10.1016\/j.dam.2014.03.011_br000065","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1145\/1345375.1345410","article-title":"The linear twin towers of Hanoi problem","volume":"39","author":"Minsker","year":"2007","journal-title":"SIGCSE Bull."},{"issue":"1","key":"10.1016\/j.dam.2014.03.011_br000070","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1093\/comjnl\/47.1.20","article-title":"The tower of Hanoi with forbidden moves","volume":"47","author":"Sapir","year":"2004","journal-title":"Comput. J."},{"key":"10.1016\/j.dam.2014.03.011_br000075","series-title":"In How Many Steps the k Peg Version of the Towers of Hanoi Game Can be Solved?","first-page":"356","volume":"vol. 1563","author":"Szegedy","year":"1999"},{"issue":"1","key":"10.1016\/j.dam.2014.03.011_br000080","first-page":"33","article-title":"An optimal algorithm for the Twin-Tower problem","volume":"15","author":"van Zanten","year":"1991","journal-title":"Delft Progr. Rep."},{"issue":"1","key":"10.1016\/j.dam.2014.03.011_br000085","first-page":"17","article-title":"The towers of Brahma and Hanoi revisited","volume":"14","author":"Wood","year":"1981","journal-title":"J. Recreat. Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X14001346?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X14001346?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,31]],"date-time":"2018-12-31T21:11:42Z","timestamp":1546290702000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X14001346"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12]]},"references-count":17,"alternative-id":["S0166218X14001346"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2014.03.011","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2014,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The Cyclic Towers of Antwerpen problem\u2014A challenging Hanoi variant","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2014.03.011","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2014 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}