{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T05:57:17Z","timestamp":1784095037724,"version":"3.55.0"},"reference-count":19,"publisher":"Informa UK Limited","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["International Journal of Systems Science"],"published-print":{"date-parts":[[2009,5]]},"DOI":"10.1080\/00207720802645246","type":"journal-article","created":{"date-parts":[[2009,5,7]],"date-time":"2009-05-07T18:50:05Z","timestamp":1241722205000},"page":"471-477","source":"Crossref","is-referenced-by-count":16,"title":["A mini\u2013max spanning forest approach to the political districting problem"],"prefix":"10.1080","volume":"40","author":[{"given":"Takeo","family":"Yamada","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"301","reference":[{"key":"CIT0001","doi-asserted-by":"crossref","volume-title":"Analysis and Design of Electoral Systems","author":"Balinski ML","DOI":"10.4171\/OWR\/2004\/14"},{"key":"CIT0002","volume-title":"Fair Representation","author":"Balinski ML","year":"1982"},{"key":"CIT0003","volume-title":"Why weight? A Cluster-Theoretic Approach to Political Districting, MCM2007","author":"Bottman N","year":"2007"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(01)00380-0"},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2006.01.082"},{"key":"CIT0006","volume-title":"Computers and Intractability: A Guide to the Theory of \ud835\udca9\ud835\udcab-Completeness","author":"Garey MR","year":"1978"},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1016\/S0038-0121(96)00016-X"},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(88)90046-3"},{"key":"CIT0010","volume-title":"Combinatorial Optimization\u2013Networks and Matroids","author":"Lawler EL","year":"1976"},{"key":"CIT0011","volume-title":"How to Avoid Gerrymandering: A New Algorithmic Solution","author":"Lush GB","year":"2007"},{"key":"CIT0012","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.44.8.1100"},{"key":"CIT0013","author":"Morris R","year":"2006","journal-title":"The Washington Monthly"},{"key":"CIT0014","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-111X(199903)14:3<223::AID-INT1>3.0.CO;2-7"},{"key":"CIT0015","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitriou CH","year":"1982"},{"key":"CIT0017","volume-title":"Cluster Analysis for Researchers","author":"Romesburg HC","year":"2004"},{"key":"CIT0018","author":"Smith WD","year":"2008","journal-title":"The Center for Range Voting,"},{"key":"CIT0019","volume-title":"Data Book Kanagawa 1994","year":"1994"},{"key":"CIT0021","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(94)00335-1"},{"key":"CIT0022","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(96)00155-5"}],"container-title":["International Journal of Systems Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/00207720802645246","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T22:56:21Z","timestamp":1558306581000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.tandfonline.com\/doi\/abs\/10.1080\/00207720802645246"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5]]},"references-count":19,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2009,5]]}},"alternative-id":["10.1080\/00207720802645246"],"URL":"https:\/\/doi.org\/10.1080\/00207720802645246","relation":{},"ISSN":["0020-7721","1464-5319"],"issn-type":[{"value":"0020-7721","type":"print"},{"value":"1464-5319","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,5]]}}}