{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:14:04Z","timestamp":1763468044013},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642229343"},{"type":"electronic","value":"9783642229350"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22935-0_6","type":"book-chapter","created":{"date-parts":[[2011,8,12]],"date-time":"2011-08-12T09:20:39Z","timestamp":1313140839000},"page":"62-74","source":"Crossref","is-referenced-by-count":4,"title":["O(1)-Approximations for Maximum Movement Problems"],"prefix":"10.1007","author":[{"given":"Piotr","family":"Berman","sequence":"first","affiliation":[]},{"given":"Erik D.","family":"Demaine","sequence":"additional","affiliation":[]},{"given":"Morteza","family":"Zadimoghaddam","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Basagni, S., Carosi, A., Petrioli, C.: Heuristics for Lifetime Maximization in Wireless Sensor Networks with Multiple Mobile Sinks. In: Proceedings of IEEE International Conference on Communications (ICC 2009), pp. 1\u20136 (2009)","DOI":"10.1109\/ICC.2009.5199052"},{"key":"6_CR2","unstructured":"Basagni, S., Carosi, A., Petrioli, C., Phillips, C.A.: Coordinated and Controlled Mobility of Multiple Sinks for Maximizing the Lifetime of Wireless Sensor Networks. To appear in ACM\/Springer Wireless Networks (WINET)"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Basagni, S., Carosi, A., Petrioli, C., Phillips, C.A.: Moving multiple sinks through wireless sensor networks for lifetime maximization. In: Proceedings of IEEE International Conference on Mobile Ad Hoc and Sensor Systems (MASS 2008), pp. 523\u2013526 (2008)","DOI":"10.1109\/MAHSS.2008.4660067"},{"key":"6_CR4","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. The MIT Press, Cambridge"},{"key":"#cr-split#-6_CR5.1","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., Hajiaghayi, M., Mahini, H., Gharan, S.O., Sayedi-Roshkhar, A., Zadimoghaddam, M.: Minimizing movement. ACM Transactions on Algorithms??5(3), Article 30 (July 2009);","DOI":"10.1145\/1541885.1541891"},{"key":"#cr-split#-6_CR5.2","unstructured":"Preliminary version appeared at SODA 2007"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1007\/978-3-642-04128-0_64","volume-title":"Algorithms - ESA 2009","author":"E.D. Demaine","year":"2009","unstructured":"Demaine, E.D., Hajiaghayi, M., Marx, D.: Minimizing movement: Fixed-parameter tractability. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol.\u00a05757, pp. 718\u2013729. Springer, Heidelberg (2009)"},{"key":"6_CR7","volume-title":"Introduction to Graph Theory","author":"D.B. West","year":"2001","unstructured":"West, D.B.: Introduction to Graph Theory. Prentice-Hall, Englewood Cliffs (2001)"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Friggstad, Z., Salavatipour, M.R.: Minimizing movement in mobile facility location problems. In: Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2008), pp. 357\u2013366 (2008)","DOI":"10.1109\/FOCS.2008.12"},{"key":"6_CR9","series-title":"Oxford Lecture Series in Mathematics and its Applications","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed Parameter Algorithms","author":"R. Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed Parameter Algorithms. Oxford Lecture Series in Mathematics and its Applications. Oxford University Press, Oxford (2006)"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22935-0_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,31]],"date-time":"2019-03-31T11:52:55Z","timestamp":1554033175000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22935-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642229343","9783642229350"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22935-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}