{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:24:29Z","timestamp":1742912669961,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319035772"},{"type":"electronic","value":"9783319035789"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"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":[[2013]]},"DOI":"10.1007\/978-3-319-03578-9_27","type":"book-chapter","created":{"date-parts":[[2013,11,8]],"date-time":"2013-11-08T08:52:11Z","timestamp":1383900731000},"page":"322-333","source":"Crossref","is-referenced-by-count":0,"title":["Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs"],"prefix":"10.1007","author":[{"given":"Davide","family":"Bil\u00f2","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luciano","family":"Gual\u00e0","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefano","family":"Leucci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guido","family":"Proietti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Ahmadian, S., Friggstad, Z., Swamy, C.: Local-search based approximation algorithms for mobile facility location problems. arXiv preprint arXiv:1301.4478 (2013)","DOI":"10.1137\/1.9781611973105.115"},{"key":"27_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-642-22935-0_6","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"P. Berman","year":"2011","unstructured":"Berman, P., Demaine, E.D., Zadimoghaddam, M.: O(1)-approximations for maximum movement problems. In: Goldberg, L.A., Jansen, K., Ravi, R., Rolim, J.D.P. (eds.) APPROX\/RANDOM 2011. LNCS, vol.\u00a06845, pp. 62\u201374. Springer, Heidelberg (2011)"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Bollob\u00e1s, B.: Modern graph theory, vol.\u00a0184. Springer (1998)","DOI":"10.1007\/978-1-4612-0619-4"},{"key":"27_CR4","unstructured":"Demaine, E.D., Hajiaghayi, M., Mahini, H., Sayedi-Roshkhar, A.S., Oveisgharan, S., Zadimoghaddam, M.: Minimizing movement. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 258\u2013267. Society for Industrial and Applied Mathematics (2007)"},{"key":"27_CR5","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":"27_CR6","doi-asserted-by":"crossref","unstructured":"Dinur, I., Safra, S.: On the hardness of approximating minimum vertex cover. Annals of Mathematics pp. 439\u2013485 (2005)","DOI":"10.4007\/annals.2005.162.439"},{"issue":"3","key":"27_CR7","first-page":"28","volume":"7","author":"Z. Friggstad","year":"2011","unstructured":"Friggstad, Z., Salavatipour, M.R.: Minimizing movement in mobile facility location problems. ACM Transactions on Algorithms (TALG)\u00a07(3), 28 (2011)","journal-title":"ACM Transactions on Algorithms (TALG)"},{"issue":"1","key":"27_CR8","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1112\/jlms\/s1-10.37.26","volume":"10","author":"P. Hall","year":"1935","unstructured":"Hall, P.: On representatives of subsets. J. London Math. Soc.\u00a010(1), 26\u201330 (1935)","journal-title":"J. London Math. Soc."},{"key":"27_CR9","volume-title":"Domination in graphs: advanced topics","author":"T.W. Haynes","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Domination in graphs: advanced topics, vol.\u00a040. Marcel Dekker, New York (1998)"},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"Khot, S.: On the power of unique 2-prover 1-round games. In: Proceedings of the Thiry-fourth Annual ACM Symposium on Theory of Computing, pp. 767\u2013775. ACM (2002)","DOI":"10.1145\/509907.510017"},{"issue":"3","key":"27_CR11","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/j.jcss.2007.06.019","volume":"74","author":"S. Khot","year":"2008","unstructured":"Khot, S., Regev, O.: Vertex cover might be hard to approximate to within 2- \u03b5. Journal of Computer and System Sciences\u00a074(3), 335\u2013349 (2008)","journal-title":"Journal of Computer and System Sciences"},{"key":"27_CR12","series-title":"IFIP","first-page":"47","volume-title":"IFIP TCS 2006","author":"G. Prencipe","year":"2006","unstructured":"Prencipe, G., Santoro, N.: Distributed algorithms for autonomous mobile robots. In: Navarro, G., Bertossi, L., Kohayakwa, Y. (eds.) IFIP TCS 2006. IFIP, vol.\u00a0209, pp. 47\u201362. Springer, Bostan (2006)"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03578-9_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T23:46:47Z","timestamp":1558655207000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03578-9_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319035772","9783319035789"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03578-9_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}