Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs

  • Davide Bilò
  • Luciano Gualà
  • Stefano Leucci
  • Guido Proietti
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8179)


When a large collection of objects (e.g., robots, sensors, etc.) has to be deployed in a given environment, it is often required to plan a coordinated motion of the objects from their initial position to a final configuration enjoying some global property. In such a scenario, the problem of minimizing the distance travelled, and therefore energy consumption, is of vital importance. In this paper we study several motion planning problems that arise when the objects must be moved on a network, in order to reach certain goals which are of interest for several network applications. Among the others, these goals include broadcasting messages and forming connected or interference-free networks. We study these problems with the aim to minimize a number of natural measures such as the average/overall distance travelled, the maximum distance travelled, or the number of objects that need to be moved. To this respect, we provide approximability and inapproximability results, most of which are tight.


Approximation Algorithm Polynomial Time Bipartite Graph Vertex Cover Approximate Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Ahmadian, S., Friggstad, Z., Swamy, C.: Local-search based approximation algorithms for mobile facility location problems. arXiv preprint arXiv:1301.4478 (2013)Google Scholar
  2. 2.
    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. 6845, pp. 62–74. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  3. 3.
    Bollobás, B.: Modern graph theory, vol. 184. Springer (1998)Google Scholar
  4. 4.
    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–267. Society for Industrial and Applied Mathematics (2007)Google Scholar
  5. 5.
    Demaine, E.D., Hajiaghayi, M., Marx, D.: Minimizing movement: Fixed-parameter tractability. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 718–729. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  6. 6.
    Dinur, I., Safra, S.: On the hardness of approximating minimum vertex cover. Annals of Mathematics pp. 439–485 (2005)Google Scholar
  7. 7.
    Friggstad, Z., Salavatipour, M.R.: Minimizing movement in mobile facility location problems. ACM Transactions on Algorithms (TALG) 7(3), 28 (2011)MathSciNetzbMATHGoogle Scholar
  8. 8.
    Hall, P.: On representatives of subsets. J. London Math. Soc. 10(1), 26–30 (1935)CrossRefzbMATHGoogle Scholar
  9. 9.
    Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Domination in graphs: advanced topics, vol. 40. Marcel Dekker, New York (1998)zbMATHGoogle Scholar
  10. 10.
    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–775. ACM (2002)Google Scholar
  11. 11.
    Khot, S., Regev, O.: Vertex cover might be hard to approximate to within 2- ε. Journal of Computer and System Sciences 74(3), 335–349 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Prencipe, G., Santoro, N.: Distributed algorithms for autonomous mobile robots. In: Navarro, G., Bertossi, L., Kohayakwa, Y. (eds.) IFIP TCS 2006. IFIP, vol. 209, pp. 47–62. Springer, Bostan (2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Davide Bilò
    • 1
  • Luciano Gualà
    • 2
  • Stefano Leucci
    • 3
  • Guido Proietti
    • 3
    • 4
  1. 1.Dipartimento di Scienze Umanistiche e SocialiUniversity of SassariItaly
  2. 2.Dipartimento di Ingegneria dell’ImpresaUniversity of Rome ”Tor Vergata”Italy
  3. 3.Dipartimento di Ingegneria e Scienze dell’Informazione e MatematicaUniversity of L’AquilaItaly
  4. 4.CNRIstituto di Analisi dei Sistemi ed InformaticaRomeItaly

Personalised recommendations