Abstract
Let G be a connected graph, and let V and V ′ two n-element subsets of its vertex set V(G). Imagine that we place a chip at each element of V and we want to move them into the positions of V ′ (V and V ′ may have common elements). A move is defined as shifting a chip from v 1 to v 2 (v 1,v 2 ∈ V(G)) on a path formed by edges of G so that no intermediate vertices are occupied. We give upper and lower bounds on the number of moves that are necessary, and analyze the computational complexity of this problem under various assumptions: labeled versus unlabeled chips, arbitrary graphs versus the case when the graph is the rectangular (infinite) planar grid, etc. We provide hardness and inapproximability results for several variants of the problem. We also give a linear-time algorithm which performs an optimal (minimum) number of moves for the unlabeled version in a tree, and a constant-ratio approximation algorithm for the unlabeled version in a graph. The graph algorithm uses the tree algorithm as a subroutine.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Abellanas, M., Bereg, S., Hurtado, F., Olaverri, A.G., Rappaport, D., Tejel, J.: Moving coins. Computational Geometry: Theory and Applications (to appear)
Alimonti, P., Kann, V.: Hardness of approximating problems on cubic graphs. In: Bongiovanni, G., Bovet, D.P., Di Battista, G. (eds.) CIAC 1997. LNCS, vol. 1203, pp. 288–298. Springer, Heidelberg (1997)
Archer, A.: A modern treatment of the 15 puzzle. American Mathematical Monthly 106, 793–799 (1999)
Arora, S.: Nearly linear time approximation schemes for Euclidean TSP and other geometric problems. J. of the ACM 45(5), 1–30 (1998)
Auletta, V., Monti, A., Parente, M., Persiano, P.: A linear-time algorithm for the feasibility of pebble motion in trees. Algorithmica 23, 223–245 (1999)
Bar-Yehuda, R.: One for the Price of Two: A Unified approach for approximating covering problems. Algorithmica 27, 131–144 (2000)
Bereg, S., Dumitrescu, A., Pach, J.: Sliding disks in the plane. In: Akiyama, J., Kano, M., Tan, X. (eds.) Japan Conference on Discrete and Computational Geometry 2004. LNCS, Springer, Heidelberg (2004) (to appear)
Bereg, S., Dumitrescu, A.: The lifting model for reconfiguration, Discrete & Computational Geometry (accepted); A preliminary version in Proceedings of the 21st Annual Symposium on Computational Geometry (SOCG 2005), Pisa, Italy, pp. 55–62 (June 2005)
Dumitrescu, A., Pach, J.: Pushing squares around, Graphs and Combinatorics (to appear); A preliminary version in Proceedings of the 20-th Annual Symposium on Computational Geometry (SOCG 2004), NY, June 2004, pp. 116–123 (2004)
Dumitrescu, A., Suzuki, I., Yamashita, M.: Motion planning for metamorphic systems: feasibility, decidability and distributed reconfiguration. IEEE Transactions on Robotics and Automation 20(3), 409–418 (2004)
Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)
Goemans, M.X., Williamson, D.P.: The primal-dual method for approximation algorithms and its application to network design problems. In: Hochbaum, D.S. (ed.) Approximation Algorithms for NP-Hard Problems. PWS Publishing Co. (1995)
Johnson, W.W.: Notes on the 15 puzzle. I. American Journal of Mathematics 2, 397–399 (1879)
Kornhauser, D., Miller, G., Spirakis, P.: Coordinating pebble motion on graphs, the diameter of permutation groups, and applications. In: Proceedings of the 25th Symposium on Foundations of Computer Science (FOCS 1984), pp. 241–250 (1984)
Papadimitriou, C., Raghavan, P., Sudan, M., Tamaki, H.: Motion planning on a graph. In: Proceedings of the 35-th Symposium on Foundations of Computer Science (FOCS 1994), pp. 511–520 (1994)
Papadimitriou, C., Yannakakis, M.: Optimization, approximation, and complexity classes. Journal of Computer and System Sciences 43, 425–440 (1991)
Ratner, D., Warmuth, M.: Finding a shortest solution for the (N × N)- extension of the 15-puzzle is intractable. Journal of Symbolic Computation 10, 111–137 (1990)
Story, W.E.: Notes on the 15 puzzle. II. American Journal of Mathematics 2, 399–404 (1879)
Wilson, R.M.: Graph puzzles, homotopy, and the alternating group. Journal of Combinatorial Theory, Series B 16, 86–96 (1974)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Calinescu, G., Dumitrescu, A., Pach, J. (2006). Reconfigurations in Graphs and Grids. In: Correa, J.R., Hevia, A., Kiwi, M. (eds) LATIN 2006: Theoretical Informatics. LATIN 2006. Lecture Notes in Computer Science, vol 3887. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11682462_27
Download citation
DOI: https://doi.org/10.1007/11682462_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32755-4
Online ISBN: 978-3-540-32756-1
eBook Packages: Computer ScienceComputer Science (R0)