{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,8]],"date-time":"2025-04-08T23:05:40Z","timestamp":1744153540738},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642402340"},{"type":"electronic","value":"9783642402357"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40235-7_4","type":"book-chapter","created":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:47:24Z","timestamp":1374022044000},"page":"56-73","source":"Crossref","is-referenced-by-count":12,"title":["Capacity-Constrained Network-Voronoi Diagram: A Summary of Results"],"prefix":"10.1007","author":[{"given":"KwangSoo","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Apurv Hirsh","family":"Shekhar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dev","family":"Oliver","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shashi","family":"Shekhar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","unstructured":"ABC News: Hurricane sandy\u2019s aftermath: Long lines at gas stations (2012), \n                    \n                      http:\/\/goo.gl\/omQ62\n                    \n                    \n                   (retrieved March 2013)"},{"issue":"17","key":"4_CR2","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J. Edmonds","year":"1972","unstructured":"Edmonds, J., Karp, R.M.: Theoretical improvements in algorithmic efficiency for network flow problems. Journal of the ACM\u00a019(17), 248\u2013264 (1972)","journal-title":"Journal of the ACM"},{"issue":"17","key":"4_CR3","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1002\/net.3230010206","volume":"2","author":"N. Tomizawa","year":"1971","unstructured":"Tomizawa, N.: On some techniques useful for solution of transportation network problems. Networks\u00a02(17), 173\u2013194 (1971)","journal-title":"Networks"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Daskin, M.: Network and discrete location: models, algorithms, and applications. Wiley-Interscience series in discrete mathematics and optimization. Wiley (1995)","DOI":"10.1002\/9781118032343"},{"issue":"2","key":"4_CR5","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1287\/opre.41.2.338","volume":"41","author":"J.B. Orlin","year":"1993","unstructured":"Orlin, J.B.: A faster strongly polynomial minimum cost flow algorithm. Operations Research\u00a041(2), 338\u2013350 (1993)","journal-title":"Operations Research"},{"issue":"1","key":"4_CR6","first-page":"1","volume":"22","author":"A.V. Goldberg","year":"1997","unstructured":"Goldberg, A.V.: An efficient implementation of a scaling minimum-cost flow algorithm. Operations Research\u00a022(1), 1\u201329 (1997)","journal-title":"Operations Research"},{"key":"4_CR7","unstructured":"Ahuja, R., Magnanti, T., Orlin, J.: Network flows: theory, algorithms, and applications. Prentice Hall (1993)"},{"key":"4_CR8","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency, vol.\u00a0A. Springer (2003)"},{"key":"4_CR9","series-title":"Algorithms and Combinatorics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24488-9","volume-title":"Combinatorial Optimization","author":"B. Korte","year":"2012","unstructured":"Korte, B., Vygen, J.: Combinatorial Optimization. Algorithms and Combinatorics. Springer, Heidelberg (2012)"},{"issue":"1-2","key":"4_CR10","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"H.W. Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The hungarian method for the assignment problem. Naval Research Logistics Quarterly\u00a02(1-2), 83\u201397 (1955)","journal-title":"Naval Research Logistics Quarterly"},{"issue":"1","key":"4_CR11","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1137\/0105003","volume":"5","author":"J. Munkres","year":"1957","unstructured":"Munkres, J.: Algorithms for the assignment and transportation problems. Journal of the Society for Industrial & Applied Mathematics\u00a05(1), 32\u201338 (1957)","journal-title":"Journal of the Society for Industrial & Applied Mathematics"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Goldberg, A., Tarjan, R.: Solving minimum-cost flow problems by successive approximation. In: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, pp. 7\u201318. ACM (1987)","DOI":"10.1145\/28395.28397"},{"key":"4_CR13","unstructured":"Frank, A.: Connections in combinatorial optimization, vol.\u00a038. Oxford Univ. Pr. (2011)"},{"key":"4_CR14","unstructured":"Cook, W., Cunningham, W., Pulleyblank, W., Schrijver, A.: Combinatorial Optimization. Wiley Series in Discrete Mathematics and Optimization. Wiley (2011)"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Johnson, D.S., McGeoch, C.C.: Network flows and matching: first DIMACS implementation challenge, vol.\u00a012. Amer. Mathematical Society (1993)","DOI":"10.1090\/dimacs\/012"},{"issue":"3","key":"4_CR16","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1287\/moor.15.3.430","volume":"15","author":"A.V. Goldberg","year":"1990","unstructured":"Goldberg, A.V., Tarjan, R.E.: Finding minimum-cost circulations by successive approximation. Mathematics of Operations Research\u00a015(3), 430\u2013466 (1990)","journal-title":"Mathematics of Operations Research"},{"issue":"3","key":"4_CR17","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1287\/mnsc.14.3.205","volume":"14","author":"M. Klein","year":"1967","unstructured":"Klein, M.: A primal method for minimal cost flows with applications to the assignment and transportation problems. Management Science\u00a014(3), 205\u2013220 (1967)","journal-title":"Management Science"},{"issue":"4","key":"4_CR18","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1145\/76359.76368","volume":"36","author":"A.V. Goldberg","year":"1989","unstructured":"Goldberg, A.V., Tarjan, R.E.: Finding minimum-cost circulations by canceling negative cycles. Journal of the ACM (JACM)\u00a036(4), 873\u2013886 (1989)","journal-title":"Journal of the ACM (JACM)"},{"key":"4_CR19","unstructured":"Okabe, A., Boots, B., Sugihara, K., Chiu, S.N.: Spatial tessellations: concepts and applications of Voronoi diagrams, vol.\u00a0501. Wiley (2009)"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Okabe, A., Sugihara, K.: Spatial Analysis Along Networks: Statistical and Computational Methods. Statistics in Practice. Wiley (2012)","DOI":"10.1002\/9781119967101"},{"issue":"3","key":"4_CR21","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1002\/1097-0037(200010)36:3<156::AID-NET2>3.0.CO;2-L","volume":"36","author":"M. Erwig","year":"2000","unstructured":"Erwig, M.: The graph voronoi diagram with applications. Networks\u00a036(3), 156\u2013163 (2000)","journal-title":"Networks"},{"issue":"9","key":"4_CR22","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1080\/13658810701587891","volume":"22","author":"A. Okabe","year":"2008","unstructured":"Okabe, A., Satoh, T., Furuta, T., Suzuki, A., Okano, K.: Generalized network voronoi diagrams: Concepts, computational methods, and applications. International Journal of Geographical Information Science\u00a022(9), 965\u2013994 (2008)","journal-title":"International Journal of Geographical Information Science"},{"key":"4_CR23","unstructured":"Gy\u0151ri, E.: On division of graphs to connected subgraphs. In: Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely, 1976), vol.\u00a01, pp. 485\u2013494 (1976)"},{"issue":"3-4","key":"4_CR24","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/BF01896190","volume":"30","author":"L. Lov\u00e1sz","year":"1993","unstructured":"Lov\u00e1sz, L.: A homology theory for spanning trees of a graph. Acta Mathematica Academiae Scientiarum Hungarica\u00a030(3-4), 241\u2013251 (1993)","journal-title":"Acta Mathematica Academiae Scientiarum Hungarica"},{"issue":"3","key":"4_CR25","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BF02579332","volume":"1","author":"E. Gy\u0151ri","year":"1981","unstructured":"Gy\u0151ri, E.: Partition conditions and vertex-connectivity of graphs. Combinatorica\u00a01(3), 263\u2013273 (1981)","journal-title":"Combinatorica"},{"issue":"2","key":"4_CR26","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/0166-218X(85)90008-3","volume":"10","author":"M. Dyer","year":"1985","unstructured":"Dyer, M., Frieze, A.: On the complexity of partitioning graphs into connected subgraphs. Discrete Applied Mathematics\u00a010(2), 139\u2013153 (1985)","journal-title":"Discrete Applied Mathematics"},{"key":"4_CR27","unstructured":"Diwan, A.A.: Partitioning into connected parts (slide 7) in graph partitioning problems. In: Research Promotion Workshop on Introduction to Graph and Geometric Algorithms (January 2011), \n                    \n                      http:\/\/goo.gl\/b8fTN"},{"issue":"5","key":"4_CR28","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1016\/j.disc.2006.01.006","volume":"306","author":"D. Barth","year":"2006","unstructured":"Barth, D., Fournier, H.: A degree bound on decomposable trees. Discrete Mathematics\u00a0306(5), 469\u2013477 (2006)","journal-title":"Discrete Mathematics"},{"issue":"3","key":"4_CR29","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M.L. Fredman","year":"1987","unstructured":"Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM (JACM)\u00a034(3), 596\u2013615 (1987)","journal-title":"Journal of the ACM (JACM)"},{"key":"4_CR30","unstructured":"OpenStreetMap, \n                    \n                      http:\/\/goo.gl\/Hso0\n                    \n                    \n                   (retrieved January 2013)"}],"container-title":["Lecture Notes in Computer Science","Advances in Spatial and Temporal Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40235-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T20:16:03Z","timestamp":1557951363000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40235-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642402340","9783642402357"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40235-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}