{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,14]],"date-time":"2023-09-14T02:11:48Z","timestamp":1694657508285},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2009,6,2]],"date-time":"2009-06-02T00:00:00Z","timestamp":1243900800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2009,11]]},"DOI":"10.1007\/s10878-009-9236-7","type":"journal-article","created":{"date-parts":[[2009,6,1]],"date-time":"2009-06-01T12:03:11Z","timestamp":1243857791000},"page":"350-361","source":"Crossref","is-referenced-by-count":5,"title":["The robot cleans up"],"prefix":"10.1007","volume":"18","author":[{"given":"M. E.","family":"Messinger","sequence":"first","affiliation":[]},{"given":"R. J.","family":"Nowakowski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,6,2]]},"reference":[{"key":"9236_CR1","volume-title":"Combinatorial optimization","author":"WJ Cook","year":"1998","unstructured":"Cook WJ, Cunningham WH, Pulleyblank WR, Schrijver A (1998) Combinatorial optimization. Wiley, New York"},{"key":"9236_CR2","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/BF01580113","volume":"5","author":"J Edmonds","year":"1973","unstructured":"Edmonds J, Johnson EL (1973) Matching, Euler tours and the Chinese postman. Math Program 5:88\u2013124","journal-title":"Math Program"},{"issue":"2","key":"9236_CR3","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1287\/opre.43.2.231","volume":"43","author":"HA Eiselt","year":"1995","unstructured":"Eiselt HA, Gendreau M, Laporte G (1995) Arc routing problems, part 1: the Chinese postman problem. Oper Res 43(2):213\u2013242","journal-title":"Oper Res"},{"key":"9236_CR4","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/S0166-218X(00)00334-6","volume":"117","author":"A Gajardo","year":"2002","unstructured":"Gajardo A, Goles E, Moreira A (2002) Complexity of Langton\u2019s ant. Discrete Appl Math 117:41\u201350","journal-title":"Discrete Appl Math"},{"key":"9236_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-2192-0","volume-title":"Tracking the automatic ant and other mathematical explorations","author":"D Gale","year":"1998","unstructured":"Gale D (1998) Tracking the automatic ant and other mathematical explorations. Springer, New York"},{"key":"9236_CR6","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/978-3-540-77294-1_4","volume-title":"Proceedings of the 4th workshop on combinatorial and algorithmic aspects of networking (CAAN2007)","author":"ME Messinger","year":"2007","unstructured":"Messinger ME, Nowakowski RJ, Pra\u0142at P, Wormald NC (2007) Cleaning random d-regular graphs with brushes using a degree\u2013greedy algorithm. In: Proceedings of the 4th workshop on combinatorial and algorithmic aspects of networking (CAAN2007). Lecture notes in computer science. Springer, Berlin, pp\u00a013\u201326"},{"key":"9236_CR7","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/j.tcs.2008.02.037","volume":"399","author":"ME Messinger","year":"2008","unstructured":"Messinger ME, Nowakowski RJ, Pra\u0142at P (2008) Cleaning a network with brushes. Theor Comput Sci 399:191\u2013205","journal-title":"Theor Comput Sci"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-009-9236-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-009-9236-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-009-9236-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:18:14Z","timestamp":1559261894000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-009-9236-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6,2]]},"references-count":7,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,11]]}},"alternative-id":["9236"],"URL":"https:\/\/doi.org\/10.1007\/s10878-009-9236-7","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,6,2]]}}}