{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:14:11Z","timestamp":1742973251357,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387678"},{"type":"electronic","value":"9783642387685"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38768-5_23","type":"book-chapter","created":{"date-parts":[[2013,5,17]],"date-time":"2013-05-17T04:31:28Z","timestamp":1368765088000},"page":"245-256","source":"Crossref","is-referenced-by-count":2,"title":["Parametric Power Supply Networks"],"prefix":"10.1007","author":[{"given":"Shiho","family":"Morishita","sequence":"first","affiliation":[]},{"given":"Takao","family":"Nishizeki","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"23_CR1","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1109\/61.974213","volume":"17","author":"N.G. Boulaxis","year":"2002","unstructured":"Boulaxis, N.G., Papadopoulos, M.P.: Optimal feeder routing in distribution system planning using dynamic programming technique and GIS facilities. IEEE Trans. Power Delivery\u00a017(1), 242\u2013247 (2002)","journal-title":"IEEE Trans. Power Delivery"},{"key":"23_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1007\/978-3-642-03685-9_4","volume-title":"APPROX and RANDOM 2009","author":"C. Chekuri","year":"2009","unstructured":"Chekuri, C., Ene, A., Korula, N.: Unsplittable flow in paths and trees and column-restricted packing integer programs. In: Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds.) APPROX and RANDOM 2009. LNCS, vol.\u00a05687, pp. 42\u201355. Springer, Heidelberg (2009)"},{"key":"23_CR3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/1186810.1186813","volume":"3","author":"C. Chekuri","year":"2007","unstructured":"Chekuri, C., Mydlarz, M., Shepherd, F.B.: Multicommodity demand flow in a tree. ACM Trans. on Algorithms 3, Article 3 (2007)","journal-title":"ACM Trans. on Algorithms"},{"issue":"1","key":"23_CR4","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1137\/0218003","volume":"18","author":"G. Gallo","year":"1989","unstructured":"Gallo, G., Grigoriadis, M.D., Tarjan, R.E.: A fast parametric maximum flow algorithm and applications. SIAM J. Comput.\u00a018(1), 30\u201355 (1989)","journal-title":"SIAM J. Comput."},{"key":"23_CR5","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)"},{"key":"23_CR6","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1016\/j.jda.2008.03.002","volume":"6","author":"T. Ito","year":"2008","unstructured":"Ito, T., Demaine, E.D., Zhou, X., Nishizeki, T.: Approximability of partitioning graphs with supply and demand. Journal of Discrete Algorithms\u00a06, 627\u2013650 (2008)","journal-title":"Journal of Discrete Algorithms"},{"key":"23_CR7","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/s00453-011-9573-7","volume":"64","author":"T. Ito","year":"2012","unstructured":"Ito, T., Hara, T., Zhou, X., Nishizeki, T.: Minimum cost partitions of trees with supply and demand. Algorithmica\u00a064, 400\u2013415 (2012)","journal-title":"Algorithmica"},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"2620","DOI":"10.1016\/j.dam.2008.08.012","volume":"157","author":"T. Ito","year":"2009","unstructured":"Ito, T., Zhou, X., Nishizeki, T.: Partitioning graphs of supply and demand. Discrete Applied Math.\u00a0157, 2620\u20132633 (2009)","journal-title":"Discrete Applied Math."},{"key":"23_CR9","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1142\/S0129054105003303","volume":"16","author":"T. Ito","year":"2005","unstructured":"Ito, T., Zhou, X., Nishizeki, T.: Partitioning trees of supply and demand. Int. J. Found. Comput. Sci.\u00a016, 803\u2013827 (2005)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"23_CR10","unstructured":"Kawabata, M., Nishizeki, T.: Partitioning trees with supply, demand and edge-capacity. In: Proc. of ISORA 2011. Lecture Notes in Operation Research, vol.\u00a014, pp. 51\u201358 (2011); also IEICE Trans. on Fundamentals of Electronics, Communications and Computer Science (to appear)"},{"issue":"6","key":"23_CR11","doi-asserted-by":"publisher","first-page":"1162","DOI":"10.1287\/opre.20.6.1162","volume":"20","author":"E. Minieka","year":"1972","unstructured":"Minieka, E.: Parametric network flows. Operation Research\u00a020(6), 1162\u20131170 (1972)","journal-title":"Operation Research"},{"key":"23_CR12","doi-asserted-by":"publisher","first-page":"996","DOI":"10.1109\/61.871365","volume":"15","author":"A.B. Morton","year":"2000","unstructured":"Morton, A.B., Mareels, I.M.Y.: An efficient brute-force solution to the network reconfiguration problem. IEEE Trans. Power Delivery\u00a015, 996\u20131000 (2000)","journal-title":"IEEE Trans. Power Delivery"},{"key":"23_CR13","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1109\/61.974215","volume":"17","author":"J.-H. Teng","year":"2002","unstructured":"Teng, J.-H., Lu, C.-N.: Feeder-switch relocation for customer interruption cost minimization. IEEE Trans. Power Delivery\u00a017, 254\u2013259 (2002)","journal-title":"IEEE Trans. Power Delivery"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38768-5_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,7]],"date-time":"2023-02-07T14:27:12Z","timestamp":1675780032000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-38768-5_23"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387678","9783642387685"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38768-5_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}