{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:46:03Z","timestamp":1725471963964},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540473312"},{"type":"electronic","value":"9783540473329"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11903697_30","type":"book-chapter","created":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T15:48:07Z","timestamp":1160581687000},"page":"228-235","source":"Crossref","is-referenced-by-count":0,"title":["Research of Undirected Network Capacity Expansion Based on the Spanning-Tree"],"prefix":"10.1007","author":[{"given":"Yuhua","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaihua","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hao","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Teng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","volume-title":"Network Flows: Theory, Algorithms and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms and Applications. Prentice-Hall, New York (1993)"},{"key":"30_CR2","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1016\/S0305-0548(99)00130-6","volume":"28","author":"J. Zhang","year":"2001","unstructured":"Zhang, J., Yang, C., Lin, Y.: A class of bottleneck expansion problems. Comput Oper. Res.\u00a028, 505\u2013519 (2001)","journal-title":"Comput Oper. Res."},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Yang, C., Zhang, J.Z.: A constrained capacity expansion problem on network\u00a070, 19\u201333 (1998)","DOI":"10.1080\/00207169808804733"},{"key":"30_CR4","unstructured":"Gondran, Minoux, M., Vajda, M.: Graphs and Algorithms. John Wiley and Sons, New Jersey (1984)"},{"key":"30_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0054350","volume-title":"Algorithm Theory - SWAT\u201998","author":"A.V. Goldberg","year":"1998","unstructured":"Goldberg, A.V.: Recent developments in maximum flow algorithms (Invited Lecture). In: Arnborg, S. (ed.) SWAT 1998. LNCS, vol.\u00a01432, pp. 1\u201310. Springer, Heidelberg (1998)"},{"key":"30_CR6","first-page":"418","volume":"28","author":"H.G. Wang","year":"2001","unstructured":"Wang, H.G., Ma, S.H.: Capacity expansion problem of undirected networks. Journal of Shandong University\u00a028, 418\u2013425 (2001)","journal-title":"Journal of Shandong University"}],"container-title":["Lecture Notes in Computer Science","Simulated Evolution and Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11903697_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T17:00:32Z","timestamp":1558285232000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11903697_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540473312","9783540473329"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/11903697_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}