{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:36:30Z","timestamp":1725474990493},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540496946"},{"type":"electronic","value":"9783540496960"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11940128_14","type":"book-chapter","created":{"date-parts":[[2006,11,29]],"date-time":"2006-11-29T00:57:35Z","timestamp":1164761855000},"page":"121-130","source":"Crossref","is-referenced-by-count":3,"title":["Approximability of Partitioning Graphs with Supply and Demand"],"prefix":"10.1007","author":[{"given":"Takehiro","family":"Ito","sequence":"first","affiliation":[]},{"given":"Erik D.","family":"Demaine","sequence":"additional","affiliation":[]},{"given":"Xiao","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Takao","family":"Nishizeki","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","volume":"12","author":"S. Arnborg","year":"1991","unstructured":"Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. J.\u00a0Algorithms\u00a012, 308\u2013340 (1991)","journal-title":"J.\u00a0Algorithms"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1016\/0196-6774(90)90013-5","volume":"11","author":"H.L. Bodlaender","year":"1990","unstructured":"Bodlaender, H.L.: Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees. J.\u00a0Algorithms\u00a011, 631\u2013643 (1990)","journal-title":"J.\u00a0Algorithms"},{"key":"14_CR3","first-page":"463","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.\u00a0ACM\u00a022, 463\u2013468 (1975)","journal-title":"J.\u00a0ACM"},{"key":"14_CR4","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.\u00a0of Foundations of Computer Science\u00a016, 803\u2013827 (2005)","journal-title":"International J.\u00a0of Foundations of Computer Science"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Ito, T., Zhou, X., Nishizeki, T.: Partitioning graphs of supply and demand. In: Proc.\u00a0of the 2005 IEEE Int\u2019l. Symposium on Circuits and Syst., pp. 160\u2013163 (2005)","DOI":"10.1109\/ISCAS.2005.1464549"},{"key":"14_CR6","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.\u00a0on Power Delivery\u00a015, 996\u20131000 (2000)","journal-title":"IEEE Trans.\u00a0on Power Delivery"},{"volume-title":"Computational Complexity","year":"1994","author":"C.H. Papadimitriou","key":"14_CR7","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"C.H. Papadimitriou","year":"1991","unstructured":"Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation, and complexity classes. J.\u00a0Computer and System Sciences\u00a043, 425\u2013440 (1991)","journal-title":"J.\u00a0Computer and System Sciences"},{"key":"14_CR9","first-page":"623","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.\u00a0ACM\u00a029, 623\u2013641 (1982)","journal-title":"J.\u00a0ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11940128_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:49:43Z","timestamp":1619495383000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11940128_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540496946","9783540496960"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/11940128_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}