{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:20:32Z","timestamp":1725549632744},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540241270"},{"type":"electronic","value":"9783540304975"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30497-5_17","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T13:30:53Z","timestamp":1268400653000},"page":"105-110","source":"Crossref","is-referenced-by-count":0,"title":["Optimal Capacity Expansion Arc Algorithm on Networks"],"prefix":"10.1007","author":[{"given":"Yuhua","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shengsheng","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingzhong","family":"Mao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peng","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","volume-title":"Network Optimization","author":"V.K. Balakrishnam","year":"1995","unstructured":"Balakrishnam, V.K.: Network Optimization. Chapman & Hall, London (1995)"},{"key":"17_CR2","volume-title":"Network Flows:Theory, Algorithms and Applications","author":"R.K. Ahujia","year":"1993","unstructured":"Ahujia, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows:Theory, Algorithms and Applications. Prentice-Hall, Englewood Cliffs (1993)"},{"issue":"5","key":"17_CR3","doi-asserted-by":"publisher","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"L.R. Ford","year":"1956","unstructured":"Ford, L.R., Fulkerson, D.R.: Maximum flow through a network. Canadian Journal of Math.\u00a08(5), 399\u2013404 (1956)","journal-title":"Canadian Journal of Math."},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S089548019733103X","volume":"12","author":"V. Andrew","year":"1999","unstructured":"Andrew, V., Goldberg, S.R.: Flows in Undirected Unit Capacity Networks. SIAM Journal on Discrete Mathematics\u00a012, 1\u20135 (1999)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1016\/S0305-0548(99)00130-6","volume":"286","author":"J. Zhang","year":"2001","unstructured":"Zhang, J., Yang, C., Lin, Y.: A class of bottleneck expansion problems. Computer Operate Research\u00a0286, 505\u2013519 (2001)","journal-title":"Computer Operate Research"},{"issue":"10","key":"17_CR6","doi-asserted-by":"publisher","first-page":"1047","DOI":"10.1360\/02ww0300","volume":"48","author":"S. Yu","year":"2003","unstructured":"Yu, S., Liu, Y., Mao, J., Xu, K.: Algorithm of capacity expansion networks on optimization. Chinese Science Bulletin\u00a048(10), 1047\u20131050 (2003)","journal-title":"Chinese Science Bulletin"}],"container-title":["Lecture Notes in Computer Science","Computational and Information Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30497-5_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:55:38Z","timestamp":1605761738000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30497-5_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540241270","9783540304975"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30497-5_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}