{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:37:40Z","timestamp":1759847860430},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2014,2,18]],"date-time":"2014-02-18T00:00:00Z","timestamp":1392681600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2015,2]]},"DOI":"10.1007\/s10107-014-0762-4","type":"journal-article","created":{"date-parts":[[2014,2,17]],"date-time":"2014-02-17T18:53:32Z","timestamp":1392663212000},"page":"425-457","source":"Crossref","is-referenced-by-count":10,"title":["Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning"],"prefix":"10.1007","volume":"149","author":[{"given":"Douglas M.","family":"King","sequence":"first","affiliation":[]},{"given":"Sheldon H.","family":"Jacobson","sequence":"additional","affiliation":[]},{"given":"Edward C.","family":"Sewell","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,2,18]]},"reference":[{"key":"762_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-9260(95)00008-4","volume":"19","author":"CJ Alpert","year":"1995","unstructured":"Alpert, C.J., Kahng, A.B.: Recent directions in netlist partitioning: a survey. INTEGRATION. VLSI J. 19, 1\u201381 (1995)","journal-title":"VLSI J."},{"issue":"6","key":"762_CR2","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1051\/ita\/1995290604871","volume":"29","author":"D Barth","year":"1995","unstructured":"Barth, D., Pellegrini, F., Raspaud, A., Roman, J.: On bandwidth, cutwidth, and quotient graphs. Theor. Inform. Appl. 29(6), 487\u2013508 (1995)","journal-title":"Theor. Inform. Appl."},{"issue":"2","key":"762_CR3","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1002\/(SICI)1097-0037(199809)32:2<115::AID-NET4>3.0.CO;2-E","volume":"32","author":"RI Becker","year":"1998","unstructured":"Becker, R.I., Lari, I., Lucertini, M., Simeone, B.: Max-min partitioning of grid graphs into connected components. Networks 32(2), 115\u2013125 (1998)","journal-title":"Networks"},{"issue":"1","key":"762_CR4","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/j.tcs.2003.05.002","volume":"321","author":"MA Bender","year":"2004","unstructured":"Bender, M.A., Farach-Colton, M.: The level ancestor problem simplified. Theor. Comput. Sci. 321(1), 5\u201312 (2004)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"762_CR5","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/S0377-2217(01)00380-0","volume":"144","author":"B Bozkaya","year":"2003","unstructured":"Bozkaya, B., Erkut, E., Laporte, G.: A tabu search heuristic and adaptive memory procedure for political districting. Eur. J. Oper. Res. 144(1), 12\u201326 (2003)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"762_CR6","doi-asserted-by":"crossref","first-page":"1533","DOI":"10.1137\/070693217","volume":"38","author":"AL Buchsbaum","year":"2008","unstructured":"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\u20131573 (2008)","journal-title":"SIAM J. Comput."},{"key":"762_CR7","volume-title":"Congressional Redistricting: Comparative and Theoretical Perspectives","author":"D Butler","year":"1992","unstructured":"Butler, D., Cain, B.E.: Congressional Redistricting: Comparative and Theoretical Perspectives. MacMillan Publishing Company, New York (1992)"},{"key":"762_CR8","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/S0020-0190(96)00175-5","volume":"60","author":"J Chleb\u00edkov\u00e1","year":"1996","unstructured":"Chleb\u00edkov\u00e1, J.: Approximating the maximally balanced connected partition problem in graphs. Inf. Process. Lett. 60, 225\u2013230 (1996)","journal-title":"Inf. Process. Lett."},{"key":"762_CR9","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719819","volume-title":"Evaluation and Optimization of Electoral Systems","author":"PG Cortona di","year":"1999","unstructured":"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)"},{"key":"762_CR10","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1016\/S0305-0548(01)00056-9","volume":"29","author":"S D\u2019Amico","year":"2002","unstructured":"D\u2019Amico, S., Wang, S., Batta, R., Rump, C.: A simulated annealing approach to police district design. Comput. Oper. Res. 29, 667\u2013684 (2002)","journal-title":"Comput. Oper. Res."},{"key":"762_CR11","doi-asserted-by":"crossref","unstructured":"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\u20139.28. Chapman & Hall\/CRC, London (2010)","DOI":"10.1201\/9781584888239-c9"},{"key":"762_CR12","doi-asserted-by":"crossref","unstructured":"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\u2013217. ACM, New York, NY (1993)","DOI":"10.1145\/167088.167159"},{"issue":"1","key":"762_CR13","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0196-6774(92)90004-V","volume":"13","author":"D Eppstein","year":"1992","unstructured":"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\u201354 (1992)","journal-title":"J. Algorithms"},{"key":"762_CR14","doi-asserted-by":"crossref","unstructured":"Fiduccia, C.M., Mattheyses, R.M.: A linear-time heuristic for improving network partitions. In: DAC \u201982: Proceedings of the 19th Design Automation Conference, pp. 175\u2013181. IEEE Press, Piscataway, NJ (1982)","DOI":"10.1109\/DAC.1982.1585498"},{"key":"762_CR15","unstructured":"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\u20139, 2012, pp. 195\u2013207. Springer, Berlin (2012)"},{"issue":"1","key":"762_CR16","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1007\/s004530010032","volume":"28","author":"D Frigioni","year":"2000","unstructured":"Frigioni, D., Italiano, G.F.: Dynamically switching vertices in planar graphs. Algorithmica 28(1), 76\u2013103 (2000)","journal-title":"Algorithmica"},{"issue":"4","key":"762_CR17","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1145\/320211.320215","volume":"46","author":"MR Henzinger","year":"1999","unstructured":"Henzinger, M.R., King, V.: Randomized fully dynamic graph algorithms with polylogarithmic time per operation. J. ACM 46(4), 502\u2013516 (1999)","journal-title":"J. ACM"},{"issue":"2","key":"762_CR18","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1137\/S0097539797327209","volume":"31","author":"MR Henzinger","year":"2001","unstructured":"Henzinger, M.R., King, V.: Maintaining minimum spanning forests in dynamic graphs. SIAM J. Comput. 31(2), 364\u2013374 (2001)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"762_CR19","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1145\/502090.502095","volume":"48","author":"J Holm","year":"2001","unstructured":"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\u2013760 (2001)","journal-title":"J. ACM"},{"key":"762_CR20","volume-title":"Fundamentals of Computer Algorithms","author":"E Horowitz","year":"1978","unstructured":"Horowitz, E., Sahni, S.: Fundamentals of Computer Algorithms. Computer Science Press, Rockville (1978)"},{"issue":"1","key":"762_CR21","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"BW Kernighan","year":"1970","unstructured":"Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49(1), 291\u2013307 (1970)","journal-title":"Bell Syst. Tech. J."},{"issue":"5","key":"762_CR22","doi-asserted-by":"crossref","first-page":"1213","DOI":"10.1287\/opre.1120.1083","volume":"60","author":"DM King","year":"2012","unstructured":"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\u20131228 (2012)","journal-title":"Oper. Res."},{"issue":"1","key":"762_CR23","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1145\/357062.357071","volume":"1","author":"T Lengauer","year":"1979","unstructured":"Lengauer, T., Tarjan, R.E.: A fast algorithm for finding dominators in a flowgraph. ACM Trans. Program. Lang. Syst. 1(1), 121\u2013141 (1979)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"1","key":"762_CR24","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0020-0190(87)90095-0","volume":"25","author":"JH Reif","year":"1987","unstructured":"Reif, J.H.: A topological approach to dynamic graph connectivity. Inf. Process. Lett. 25(1), 65\u201370 (1987)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"762_CR25","first-page":"61","volume":"42","author":"F Ricca","year":"2004","unstructured":"Ricca, F.: A multicriteria districting heuristic for the aggregation of zones and its use in computing origin-destination matrices. INFOR 42(1), 61\u201377 (2004)","journal-title":"INFOR"},{"issue":"3","key":"762_CR26","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/s10288-011-0177-5","volume":"9","author":"F Ricca","year":"2011","unstructured":"Ricca, F., Scozzari, A., Simeone, B.: Political districting: from classical models to recent approaches. 4OR 9(3), 223\u2013254 (2011)","journal-title":"4OR"},{"key":"762_CR27","doi-asserted-by":"crossref","first-page":"1409","DOI":"10.1016\/j.ejor.2006.08.065","volume":"189","author":"F Ricca","year":"2008","unstructured":"Ricca, F., Simeone, B.: Local search algorithms for political districting. Eur. J. Oper. Res. 189, 1409\u20131426 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"762_CR28","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/j.endm.2004.06.033","volume":"18","author":"LRB Salgado","year":"2004","unstructured":"Salgado, L.R.B., Wakabayashi, Y.: Approximation results on balanced connected partitions of graphs. Electron. Notes Discret. Math. 18, 207\u2013212 (2004)","journal-title":"Electron. Notes Discret. Math."},{"issue":"8","key":"762_CR29","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J Shi","year":"2000","unstructured":"Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 22(8), 888\u2013905 (2000)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"2","key":"762_CR30","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R Tarjan","year":"1972","unstructured":"Tarjan, R.: Depth-first search and linear graph algorithms. SIAM J. Comput. 1(2), 146\u2013160 (1972)","journal-title":"SIAM J. Comput."},{"key":"762_CR31","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s10479-007-0181-5","volume":"154","author":"F Tavares-Pereira","year":"2007","unstructured":"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\u201392 (2007)","journal-title":"Ann. Oper. Res."},{"key":"762_CR32","doi-asserted-by":"crossref","unstructured":"Thorup, M.: Near-optimal fully-dynamic graph connectivity. In: Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, pp. 343\u2013350. ACM, New York, NY (2000)","DOI":"10.1145\/335305.335345"},{"key":"762_CR33","unstructured":"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"},{"key":"762_CR34","unstructured":"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"},{"issue":"6","key":"762_CR35","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1109\/34.683775","volume":"20","author":"JP Wang","year":"1998","unstructured":"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\u2013636 (1998)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"762_CR36","volume-title":"Introduction to Graph Theory","author":"DB West","year":"2001","unstructured":"West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall, Upper Saddle River (2001)","edition":"2"},{"issue":"2","key":"762_CR37","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1090\/S0002-9947-1932-1501641-2","volume":"34","author":"H Whitney","year":"1932","unstructured":"Whitney, H.: Non-separable and planar graphs. Trans. Am. Math. Soc. 34(2), 339\u2013362 (1932)","journal-title":"Trans. Am. Math. Soc."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-014-0762-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-014-0762-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-014-0762-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,26]],"date-time":"2022-03-26T20:27:45Z","timestamp":1648326465000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-014-0762-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2,18]]},"references-count":37,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2015,2]]}},"alternative-id":["762"],"URL":"https:\/\/doi.org\/10.1007\/s10107-014-0762-4","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,2,18]]}}}