Abstract
Graph partitioning is an intractable problem that arises in many practical applications. Heuristics such as local search generate good (though suboptimal) solutions in limited time. Such heuristics must be able to explore the solution space quickly and, when the solution space is constrained, differentiate feasible solutions from infeasible ones. Geographic zoning problems allocate some resource (e.g., political representation, school enrollment, police patrols) to contiguous zones modeled by partitions of an embedded planar graph. Each vertex corresponds to an area of the plane (e.g., census block, town, county), and local search moves one area from its current zone to a different zone in each iteration. Enforcing contiguity constraints may require significant computation when the graph is large. While existing algorithms require linear or polylogarithmic time (in the number of vertices) to assess contiguity in each local search iteration, the geo-graph paradigm shows how contiguity can be verified by examining only the set of vertices that border the transferred area (i.e., those areas whose boundaries share at least a single point with the boundary of the transferred area). This paper develops efficient algorithms that examine these vertices more quickly than traditional search-based methods, allowing practitioners to more fully consider their zoning options when creating zones with local search.
Similar content being viewed by others
References
Alpert, C.J., Kahng, A.B.: Recent directions in netlist partitioning: a survey. INTEGRATION. VLSI J. 19, 1–81 (1995)
Barth, D., Pellegrini, F., Raspaud, A., Roman, J.: On bandwidth, cutwidth, and quotient graphs. Theor. Inform. Appl. 29(6), 487–508 (1995)
Becker, R.I., Lari, I., Lucertini, M., Simeone, B.: Max-min partitioning of grid graphs into connected components. Networks 32(2), 115–125 (1998)
Bender, M.A., Farach-Colton, M.: The level ancestor problem simplified. Theor. Comput. Sci. 321(1), 5–12 (2004)
Bozkaya, B., Erkut, E., Laporte, G.: A tabu search heuristic and adaptive memory procedure for political districting. Eur. J. Oper. Res. 144(1), 12–26 (2003)
Buchsbaum, A.L., Georgiadis, L., Kaplan, H., Rogers, A., Tarjan, R.E., Westbrook, J.R.: Linear-time algorithms for dominators and other path-evaluation problems. SIAM J. Comput. 38(4), 1533–1573 (2008)
Butler, D., Cain, B.E.: Congressional Redistricting: Comparative and Theoretical Perspectives. MacMillan Publishing Company, New York (1992)
Chlebíková, J.: Approximating the maximally balanced connected partition problem in graphs. Inf. Process. Lett. 60, 225–230 (1996)
di Cortona, P.G., Manzi, C., Pennisi, A., Ricca, F., Simeone, B.: Evaluation and Optimization of Electoral Systems. Society for Industrial and Applied Mathematics, Philadelphia (1999)
D’Amico, S., Wang, S., Batta, R., Rump, C.: A simulated annealing approach to police district design. Comput. Oper. Res. 29, 667–684 (2002)
Demetrescu, C., Eppstein, D., Galil, Z., Italiano, G.F.: Dynamic graph algorithms. In: Atallah, M.J., Blanton, M. (eds.) Algorithms and Theory of Computation Handbook, 2nd edn. pp. 9.1–9.28. Chapman & Hall/CRC, London (2010)
Eppstein, D., Galil, Z., Italiano, G.F., Spencer, T.H.: Separator based sparsification for dynamic planar graph algorithms. In: Proceedings of the 25th Annual ACM Symposium on Theory of Computing, pp. 208–217. ACM, New York, NY (1993)
Eppstein, D., Italiano, G.F., Tamassia, R., Tarjan, R.E., Westbrook, J., Yung, M.: Maintenance of a minimum spanning forest in a dynamic plane graph. J. Algorithms 13(1), 33–54 (1992)
Fiduccia, C.M., Mattheyses, R.M.: A linear-time heuristic for improving network partitions. In: DAC ’82: Proceedings of the 19th Design Automation Conference, pp. 175–181. IEEE Press, Piscataway, NJ (1982)
Firmani, D., Italiano, G.F., Laura, L., Orlandi, A., Santaroni, F.: Computing strong articulation points and strong bridges in large scale graphs. In: Klasing, R. (ed.) Experimental Algorithms: Proceedings of the 11th International Symposium, SEA 2012, Bordeaux, France, June 7–9, 2012, pp. 195–207. Springer, Berlin (2012)
Frigioni, D., Italiano, G.F.: Dynamically switching vertices in planar graphs. Algorithmica 28(1), 76–103 (2000)
Henzinger, M.R., King, V.: Randomized fully dynamic graph algorithms with polylogarithmic time per operation. J. ACM 46(4), 502–516 (1999)
Henzinger, M.R., King, V.: Maintaining minimum spanning forests in dynamic graphs. SIAM J. Comput. 31(2), 364–374 (2001)
Holm, J., de Lichtenberg, K., Thorup, M.: Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. J. ACM 48(4), 723–760 (2001)
Horowitz, E., Sahni, S.: Fundamentals of Computer Algorithms. Computer Science Press, Rockville (1978)
Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49(1), 291–307 (1970)
King, D.M., Jacobson, S.H., Sewell, E.C., Cho, W.K.T.: Geo-graphs: an efficient model for enforcing contiguity and hole constraints in planar graph partitioning. Oper. Res. 60(5), 1213–1228 (2012)
Lengauer, T., Tarjan, R.E.: A fast algorithm for finding dominators in a flowgraph. ACM Trans. Program. Lang. Syst. 1(1), 121–141 (1979)
Reif, J.H.: A topological approach to dynamic graph connectivity. Inf. Process. Lett. 25(1), 65–70 (1987)
Ricca, F.: A multicriteria districting heuristic for the aggregation of zones and its use in computing origin-destination matrices. INFOR 42(1), 61–77 (2004)
Ricca, F., Scozzari, A., Simeone, B.: Political districting: from classical models to recent approaches. 4OR 9(3), 223–254 (2011)
Ricca, F., Simeone, B.: Local search algorithms for political districting. Eur. J. Oper. Res. 189, 1409–1426 (2008)
Salgado, L.R.B., Wakabayashi, Y.: Approximation results on balanced connected partitions of graphs. Electron. Notes Discret. Math. 18, 207–212 (2004)
Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 22(8), 888–905 (2000)
Tarjan, R.: Depth-first search and linear graph algorithms. SIAM J. Comput. 1(2), 146–160 (1972)
Tavares-Pereira, F., Figueira, J.R., Mousseau, V., Roy, B.: Multiple criteria districting problems: the public transportation network pricing system of the Paris region. Ann. Oper. Res. 154, 69–92 (2007)
Thorup, M.: Near-optimal fully-dynamic graph connectivity. In: Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, pp. 343–350. ACM, New York, NY (2000)
United States Census Bureau: Apportionment Population and Number of Representatives, by State: Census 2000. http://www.census.gov/population/www/cen2000/maps/files/tab01.pdf (2000). Accessibility Verified on 27 May 2011
United States Census Bureau: Tallies of Census Blocks By State or State Equivalent. http://www.census.gov/geo/www/2010census/census_block_tally.html (2011). Accessibility Verified on 27 May 2011
Wang, J.P.: Stochastic relaxation on partitions with connected components and its application to image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 20(6), 619–636 (1998)
West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall, Upper Saddle River (2001)
Whitney, H.: Non-separable and planar graphs. Trans. Am. Math. Soc. 34(2), 339–362 (1932)
Author information
Authors and Affiliations
Corresponding author
Additional information
This research has been supported in part by the National Science Foundation (IIS-0827540). The second author was also supported in part by the Air Force Office of Scientific Research (FA9550-10-1-0387). This material is based upon work supported in part while the second author served at the National Science Foundation. The views expressed in this paper are those of the authors and do not reflect the official policy or position of the United States Air Force, National Science Foundation, or the United States Government. The computational work was conducted with support from the Simulation and Optimization Laboratory at the University of Illinois.
Appendix A: Additional geo-graph lemmas
Appendix A: Additional geo-graph lemmas
The following lemmas from [22] are applied in the proofs contained in this paper:
Lemma 16
Let \(G = (V, E, B, z)\) be a geo-graph, \(C^S \subseteq V\) be a tangle-free closed strand on which \(x, v, y \in V\) appear consecutively, and \(W_1, W_2 \subseteq R(v)\) be the (\(x\), \(y\))-perimeters on \(v\).
-
A. For some \(j \in \{1, 2\}\), \(W_j \cap N(v) \subseteq C^S \cup Int(C^S)\) and \(W_{3-j} \cap N(v) \subseteq C^S \cup Ext(C^S)\)
-
B. If \(C = C^S\) is a cycle, then for some \(j \in \{1, 2\}\), \(W_j \subseteq C \cup Int(C)\) and \(W_{3-j} \subseteq C \cup Ext(C)\). Furthermore, \(W_j\) is unbroken and therefore is an \(x\), \(y\)-walk on \(R(v) \cap (C \cup Int(C))\).
Lemma 17
Let \(G = (V, E, B, z)\) be a geo-graph, with \(C^S \subset V\) being any tangle-free closed strand, and \(x \in V-C^S\). The following properties hold:
-
A. For every \(y \in N(x)-C^S\), \(y \in Int(C^S)\) if and only if \(x \in Int(C^S)\).
-
B. If \(C = C^S\) is a cycle, then for every \(y \in R(x)-C\), \(y \in Int(C)\) if and only if \(x \in Int(C)\).
-
C. If \(C = C^S\) is a cycle and \(B(x) \cap B(v_0) \ne \emptyset \), then \(x \notin Int(C)\).
-
D. If \(y \in V-C^S\) such that \(x \in Int(C^S)\) and \(y \in Ext(C^S)\), then each \(x\), \(y\)-path, \(P\), has \(P \cap C^S \ne \emptyset \).
-
E. If \(C = C^S\) is a cycle and \(y \in V-C\) such that \(x \in Int(C)\) and \(y \in Ext(C)\), then each \(x\), \(y\)-strand, \(S\), has \(S \cap C \ne \emptyset \).
-
F. If \(G\) is zone-connected with \(z(x) = i\) for some \(i \in M(G)\), \(C = C^S\) is a cycle, and \(C \subseteq V(j)\) for some \(j \in M(G) - i\), then zone \(i\) is surrounded by \(C\) if and only if \(x \in Int(C)\).
Rights and permissions
About this article
Cite this article
King, D.M., Jacobson, S.H. & Sewell, E.C. Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning. Math. Program. 149, 425–457 (2015). https://doi.org/10.1007/s10107-014-0762-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10107-014-0762-4