{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:21:44Z","timestamp":1725571304727},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642175138"},{"type":"electronic","value":"9783642175145"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17514-5_30","type":"book-chapter","created":{"date-parts":[[2010,12,3]],"date-time":"2010-12-03T15:09:23Z","timestamp":1291388963000},"page":"351-362","source":"Crossref","is-referenced-by-count":1,"title":["Minimum Cost Partitions of Trees with Supply and Demand"],"prefix":"10.1007","author":[{"given":"Takehiro","family":"Ito","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takuya","family":"Hara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiao","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takao","family":"Nishizeki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_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, 242\u2013247 (2002)","journal-title":"IEEE Trans. on Power Delivery"},{"key":"30_CR2","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":"30_CR3","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/321906.321909","volume":"22","author":"O.H. Ibarra","year":"1975","unstructured":"Ibarra, O.H., Kim, C.E.: Fast approximation algorithms for the knapsack and sum of subset problems. J. ACM\u00a022, 463\u2013468 (1975)","journal-title":"J. ACM"},{"key":"30_CR4","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. J. of Discrete Algorithms\u00a06, 627\u2013650 (2008)","journal-title":"J. of Discrete Algorithms"},{"key":"30_CR5","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. International J. of Foundations of Computer Science\u00a016, 803\u2013827 (2005)","journal-title":"International J. of Foundations of Computer Science"},{"key":"30_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 Mathematics\u00a0157, 2620\u20132633 (2009)","journal-title":"Discrete Applied Mathematics"},{"key":"30_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack Problems","author":"H. Kellerer","year":"2004","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Heidelberg (2004)"},{"key":"30_CR8","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, 996\u20131000 (2000)","journal-title":"IEEE Trans. on Power Delivery"},{"key":"30_CR9","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, 254\u2013259 (2002)","journal-title":"IEEE Trans. on Power Delivery"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17514-5_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T13:04:23Z","timestamp":1553259863000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17514-5_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642175138","9783642175145"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17514-5_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}