{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:10:18Z","timestamp":1725516618001},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540850960"},{"type":"electronic","value":"9783540850977"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85097-7_29","type":"book-chapter","created":{"date-parts":[[2008,8,19]],"date-time":"2008-08-19T07:18:26Z","timestamp":1219130306000},"page":"309-318","source":"Crossref","is-referenced-by-count":1,"title":["The Robot Cleans Up"],"prefix":"10.1007","author":[{"given":"Margaret-Ellen","family":"Messinger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard J.","family":"Nowakowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/BF01580113","volume":"5","author":"J. Edmonds","year":"1973","unstructured":"Edmonds, J., Johnson, E.L.: Matching, Euler Tours and the Chinese Postman. Mathematical Programming\u00a05, 88\u2013124 (1973)","journal-title":"Mathematical Programming"},{"key":"29_CR2","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.: Tracking the automatic ant and other mathematical explorations. Springer, New York (1998)"},{"key":"29_CR3","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.tcs.2008.02.037","volume":"399","author":"M.E. Messinger","year":"2008","unstructured":"Messinger, M.E., Nowakowski, R.J., Pra\u0142at, P.: Cleaning a Network with Brushes. Theoretical Computer Science\u00a0399, 191\u2013205 (2008)","journal-title":"Theoretical Computer Science"},{"key":"29_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-540-77294-1_4","volume-title":"Combinatorial and Algorithmic Aspects of Networking","author":"M.E. Messinger","year":"2007","unstructured":"Messinger, M.E., Nowakowski, R.J., Pra\u0142at, P., Wormald, N.C.: Cleaning random d-regular graphs with brushes using a degree\u2013greedy algorithm. In: Janssen, J., Pra\u0142at, P. (eds.) CAAN 2007. LNCS, vol.\u00a04852, pp. 13\u201326. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85097-7_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:41:02Z","timestamp":1619523662000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85097-7_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540850960","9783540850977"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85097-7_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}