{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T11:33:46Z","timestamp":1725881626754},"publisher-location":"Singapore","reference-count":14,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811039683"},{"type":"electronic","value":"9789811039690"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-981-10-3969-0_29","type":"book-chapter","created":{"date-parts":[[2017,3,2]],"date-time":"2017-03-02T09:54:59Z","timestamp":1488448499000},"page":"254-259","source":"Crossref","is-referenced-by-count":1,"title":["Area Constrained Space Information Flow"],"prefix":"10.1007","author":[{"given":"Alfred","family":"Uwitonze","sequence":"first","affiliation":[]},{"given":"Jiaqing","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Yuanqing","family":"Ye","sequence":"additional","affiliation":[]},{"given":"Wenqing","family":"Cheng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,3,3]]},"reference":[{"issue":"4","key":"29_CR1","doi-asserted-by":"crossref","first-page":"1204","DOI":"10.1109\/18.850663","volume":"46","author":"R Ahlswede","year":"2000","unstructured":"Ahlswede, R., Cai, N., Li, S.Y.R., Yeung, R.W.: Network information flow. IEEE Trans. Inf. Theory 46(4), 1204\u20131216 (2000)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Li, Z., Wu, C.: Space information flow: multiple unicast. In: Proceedings of IEEE ISIT, pp. 1897\u20131901 (2012)","DOI":"10.1109\/ISIT.2012.6283627"},{"issue":"6","key":"29_CR3","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"RC Prim","year":"1957","unstructured":"Prim, R.C.: Shortest connection networks and some generalizations. Bell Syst. Tech. J. 36(6), 1389\u20131401 (1957)","journal-title":"Bell Syst. Tech. J."},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"Huang, J., Yin, X., Zhang, X., Du, X., Li, Z.: On space information flow: single multicast. In: Proceedings of IEEE NetCod, pp. 1\u20136 (2013)","DOI":"10.1109\/NetCod.2013.6570816"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Huang, J., Li, Z.: A recursive partitioning algorithm for space information flow. In: Proceedings of IEEE GLOBECOM, pp. 1460\u20131465 (2014)","DOI":"10.1109\/GLOCOM.2014.7037014"},{"issue":"1","key":"29_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0116001","volume":"16","author":"EN Gilbert","year":"1968","unstructured":"Gilbert, E.N., Pollak, H.O.: Steiner minimal trees. SIAM J. Appl. Math. 16(1), 1\u201329 (1968)","journal-title":"SIAM J. Appl. Math."},{"key":"29_CR7","unstructured":"Van Laarhoven, J.M.: Exact and heuristic algorithms for the Euclidean Steiner tree problem. Ph.D. thesis, University of Iowa (2010)"},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"Yin, X., Wang, Y., Wang, X., Xue, X., Li, Z.: Min-cost multicast networks in Euclidean space. In: Proceedings of IEEE ISIT, pp. 1316\u20131320 (2012)","DOI":"10.1109\/ISIT.2012.6283071"},{"issue":"5","key":"29_CR9","doi-asserted-by":"crossref","first-page":"2884","DOI":"10.1109\/TIT.2014.2308998","volume":"60","author":"T Xiahou","year":"2014","unstructured":"Xiahou, T., Li, Z., Wu, C., Huang, J.: A geometric perspective to multiple-unicast network coding. IEEE Trans. Inf. Theory 60(5), 2884\u20132895 (2014)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"29_CR10","first-page":"17","volume":"9","author":"Y Hu","year":"2014","unstructured":"Hu, Y., Niu, D., Li, Z.: Internet video multicast via constrained space information flow. IEEE MMTC E-Lett. 9(2), 17\u201319 (2014)","journal-title":"IEEE MMTC E-Lett."},{"issue":"1","key":"29_CR11","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1002\/net.3230110104","volume":"11","author":"JM Smith","year":"1981","unstructured":"Smith, J.M., Lee, D.T., Liebman, J.S.: An O(n log n) heuristic for Steiner minimal tree problems on the Euclidean metric. Networks 11(1), 23\u201339 (1981)","journal-title":"Networks"},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"Li, Z.: Min-cost multicast of selfish information flows. In: Proceedings of IEEE INFOCOM, pp. 231\u2013239 (2007)","DOI":"10.1109\/INFCOM.2007.35"},{"issue":"3","key":"29_CR13","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1002\/(SICI)1097-0037(199710)30:3<149::AID-NET1>3.0.CO;2-L","volume":"30","author":"P Winter","year":"1997","unstructured":"Winter, P., Zachariasen, M.: Euclidean Steiner minimum trees: an improved exact algorithm. Networks 30(3), 149\u2013166 (1997)","journal-title":"Networks"},{"issue":"11","key":"29_CR14","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"JE Beasley","year":"1990","unstructured":"Beasley, J.E.: OR-Library: distributing test problems by electronic mail. J. Oper. Res. Soc. 41(11), 1069\u20131072 (1990)","journal-title":"J. Oper. Res. Soc."}],"container-title":["Communications in Computer and Information Science","Geo-Spatial Knowledge and Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-10-3969-0_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T07:45:19Z","timestamp":1498376719000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-10-3969-0_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9789811039683","9789811039690"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-981-10-3969-0_29","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2017]]}}}