Reconfigurations in Graphs and Grids
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.
Unable to display preview. Download preview PDF.
- 1.Abellanas, M., Bereg, S., Hurtado, F., Olaverri, A.G., Rappaport, D., Tejel, J.: Moving coins. Computational Geometry: Theory and Applications (to appear)Google Scholar
- 7.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)Google Scholar
- 8.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)Google Scholar
- 9.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)Google Scholar
- 12.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)Google Scholar
- 14.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)Google Scholar
- 15.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)Google Scholar