{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T16:11:04Z","timestamp":1746115864441,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387555"},{"type":"electronic","value":"9783642387562"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38756-2_17","type":"book-chapter","created":{"date-parts":[[2013,5,21]],"date-time":"2013-05-21T00:43:48Z","timestamp":1369097028000},"page":"153-162","source":"Crossref","is-referenced-by-count":0,"title":["Spanning Distribution Trees of Graphs"],"prefix":"10.1007","author":[{"given":"Masaki","family":"Kawabata","sequence":"first","affiliation":[]},{"given":"Takao","family":"Nishizeki","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"17_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. on Power Delivery\u00a017(1), 242\u2013247 (2002)","journal-title":"IEEE Trans. on Power Delivery"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-642-03685-9_4","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","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-RANDOM 2009. LNCS, vol.\u00a05687, pp. 42\u201355. Springer, Heidelberg (2009)"},{"issue":"1","key":"17_CR3","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s004930050043","volume":"19","author":"Y. Dinitz","year":"1999","unstructured":"Dinitz, Y., Garg, N., Goemans, M.X.: On the single-source unsplittable flow problem. Combinatorica\u00a019(1), 17\u201341 (1999)","journal-title":"Combinatorica"},{"key":"17_CR4","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness (Twenty-second printing), pp. 90\u201391. W.H. Freeman and Company (2000)"},{"key":"17_CR5","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":"17_CR6","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."},{"issue":"4","key":"17_CR7","first-page":"803","volume":"16","author":"T. Ito","year":"2005","unstructured":"Ito, T., Zhou, X., Nishizeki, T.: Partitioning trees of supply and demand. IJFCS\u00a016(4), 803\u2013827 (2005)","journal-title":"IJFCS"},{"key":"17_CR8","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)"},{"key":"17_CR9","unstructured":"Kim, M.S., Lam, S.S., Lee, D.-Y.: Optimal distribution tree for internet streaming media. In: Proc. 23rd Int. Conf. on Distributed Computing System (ICDCS 2003), pp. 116\u2013125 (2003)"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Kleinberg, J.M.: Single-source unsplittable flow. In: Proc. of 37th FOCS, pp. 68\u201377 (1996)","DOI":"10.1109\/SFCS.1996.548465"},{"issue":"3","key":"17_CR11","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. on Power Delivery\u00a015(3), 996\u20131000 (2000)","journal-title":"IEEE Trans. on Power Delivery"},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0166-218X(01)00223-2","volume":"115","author":"T. Nishizeki","year":"2001","unstructured":"Nishizeki, T., Vygen, J., Zhou, X.: The edge-disjoint paths problem is NP-complete for series-parallel graphs. Discrete Applied Math.\u00a0115, 177\u2013186 (2001)","journal-title":"Discrete Applied Math."},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1145\/322326.322328","volume":"29","author":"K. Takamizawa","year":"1982","unstructured":"Takamizawa, K., Nishizeki, T., Saito, N.: Linear-time computability of combinatorial problems on series-parallel graphs. J. Assoc. Comput. Mach.\u00a029, 623\u2013641 (1982)","journal-title":"J. Assoc. Comput. Mach."},{"issue":"1","key":"17_CR14","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. on Power Delivery\u00a017(1), 254\u2013259 (2002)","journal-title":"IEEE Trans. on Power Delivery"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics and Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38756-2_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T10:42:49Z","timestamp":1746009769000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38756-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387555","9783642387562"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38756-2_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}