{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,7]],"date-time":"2026-10-07T02:27:49Z","timestamp":1791340069001,"version":"4.3.1"},"reference-count":22,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2009,7,1]],"date-time":"2009-07-01T00:00:00Z","timestamp":1246406400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["ITR ANI-0205445"],"award-info":[{"award-number":["ITR ANI-0205445"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Institute for Theoretical Physics and Mathematics","award":["CS1384-6-01CS1384-2-01"],"award-info":[{"award-number":["CS1384-6-01CS1384-2-01"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Algorithms"],"published-print":{"date-parts":[[2009,7]]},"abstract":"<jats:p>We give approximation algorithms and inapproximability results for a class of movement problems. In general, these problems involve planning the coordinated motion of a large collection of objects (representing anything from a robot swarm or firefighter team to map labels or network messages) to achieve a global property of the network while minimizing the maximum or average movement. In particular, we consider the goals of achieving connectivity (undirected and directed), achieving connectivity between a given pair of vertices, achieving independence (a dispersion problem), and achieving a perfect matching (with applications to multicasting). This general family of movement problems encompasses an intriguing range of graph and geometric algorithms, with several real-world applications and a surprising range of approximability. In some cases, we obtain tight approximation and inapproximability results using direct techniques (without use of PCP), assuming just that P \u2260 NP.<\/jats:p>","DOI":"10.1145\/1541885.1541891","type":"journal-article","created":{"date-parts":[[2009,7,8]],"date-time":"2009-07-08T17:28:33Z","timestamp":1247074113000},"page":"1-30","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":59,"title":["Minimizing movement"],"prefix":"10.1145","volume":"5","author":[{"given":"Erik D.","family":"Demaine","sequence":"first","affiliation":[{"name":"MIT, Cambridge, MA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohammadtaghi","family":"Hajiaghayi","sequence":"additional","affiliation":[{"name":"AT&amp;T Labs \u2014 Research, Florham Park, NJ"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hamid","family":"Mahini","sequence":"additional","affiliation":[{"name":"Sharif University of Technology, Tehran, Iran"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Amin S.","family":"Sayedi-Roshkhar","sequence":"additional","affiliation":[{"name":"Sharif University of Technology, Tehran, Iran"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shayan","family":"Oveisgharan","sequence":"additional","affiliation":[{"name":"Sharif University of Technology, Tehran, Iran"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Morteza","family":"Zadimoghaddam","sequence":"additional","affiliation":[{"name":"Sharif University of Technology, Tehran, Iran"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2009,7,4]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms. 568--577","author":"Arkin E. M."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/777412.777465"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1062689.1062729"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1999.1042"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/277651.277682"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.706050"},{"key":"e_1_2_1_7_1","volume-title":"Proceedings of the International Conference on Robotics and Automation.","author":"Corke P."},{"key":"e_1_2_1_8_1","volume-title":"Proceedings of the 9th International Symposium on Experimental Robotics.","author":"Corke P."},{"key":"e_1_2_1_9_1","volume-title":"Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms. 148--157","author":"Doddi S."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.10030"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1998.2754"},{"key":"e_1_2_1_12_1","volume-title":"Eds. Springer Tracts in Advanced Robotics","volume":"7","author":"Hsiang T.-R."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1997.0903"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30551-4_53"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(03)00256-4"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1995.1029"},{"key":"e_1_2_1_17_1","doi-asserted-by":"crossref","unstructured":"LaValle S. M. 2006. Planning Algorithms. Cambridge University Press. http:\/\/msl.cs.uiuc.edu\/planning\/.   LaValle S. M. 2006. Planning Algorithms. Cambridge University Press. http:\/\/msl.cs.uiuc.edu\/planning\/.","DOI":"10.1017\/CBO9780511546877"},{"key":"e_1_2_1_18_1","volume-title":"Proceedings of the Workshop on Algorithmic Foundations of Robotics. 331--345","author":"Reif J. H."},{"key":"e_1_2_1_19_1","volume-title":"Proceedings from the International Workshop on Multi-Robot Systems. Springer.","author":"Schultz A. C."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195901000444"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2004.829439"},{"key":"e_1_2_1_22_1","unstructured":"West D. B. 2001. Introduction to Graph Theory 2nd Ed. Prentice Hall Upper Saddle River.  West D. B. 2001. Introduction to Graph Theory 2nd Ed. Prentice Hall Upper Saddle River."}],"container-title":["ACM Transactions on Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1541885.1541891","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1541885.1541891","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:26:01Z","timestamp":1750278361000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1541885.1541891"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,7]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,7]]}},"alternative-id":["10.1145\/1541885.1541891"],"URL":"https:\/\/doi.org\/10.1145\/1541885.1541891","relation":{},"ISSN":["1549-6325","1549-6333"],"issn-type":[{"value":"1549-6325","type":"print"},{"value":"1549-6333","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,7]]},"assertion":[{"value":"2007-02-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2008-03-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2009-07-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}