{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T19:57:13Z","timestamp":1725479833653},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642366932"},{"type":"electronic","value":"9783642366949"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36694-9_32","type":"book-chapter","created":{"date-parts":[[2013,3,11]],"date-time":"2013-03-11T10:08:39Z","timestamp":1362996519000},"page":"375-386","source":"Crossref","is-referenced-by-count":1,"title":["Fast Deterministic Algorithms for Matrix Completion Problems"],"prefix":"10.1007","author":[{"given":"Tasuku","family":"Soma","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"32_CR1","doi-asserted-by":"publisher","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 Transactions on Information Theory\u00a046, 1204\u20131216 (2000)","journal-title":"IEEE Transactions on Information Theory"},{"key":"32_CR2","doi-asserted-by":"crossref","unstructured":"Cheung, H.Y., Lau, L.C., Leung, K.M.: Graph connectivities, network coding, and expander graphs. In: Proceedings of the 52nd Annual IEEE Symposium on Foundations of Computer Science, pp. 190\u2013199 (2011)","DOI":"10.1109\/FOCS.2011.55"},{"key":"32_CR3","doi-asserted-by":"publisher","first-page":"948","DOI":"10.1137\/0215066","volume":"15","author":"W.H. Cunningham","year":"1986","unstructured":"Cunningham, W.H.: Improved bounds for matroid partition and intersection algorithms. SIAM Journal on Computing\u00a015, 948\u2013957 (1986)","journal-title":"SIAM Journal on Computing"},{"key":"32_CR4","doi-asserted-by":"crossref","first-page":"241","DOI":"10.6028\/jres.071B.033","volume":"B71","author":"J. Edmonds","year":"1967","unstructured":"Edmonds, J.: Systems of distinct representatives and linear algebra. Journal of Research of the National Bureau of Standards\u00a0B71, 241\u2013245 (1967)","journal-title":"Journal of Research of the National Bureau of Standards"},{"key":"32_CR5","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1006\/jcss.1996.0054","volume":"53","author":"H.N. Gabow","year":"1996","unstructured":"Gabow, H.N., Xu, Y.: Efficient theoretic and practical algorithms for linear matroid intersection problems. Journal of Computer and System Sciences\u00a053, 129\u2013147 (1996)","journal-title":"Journal of Computer and System Sciences"},{"key":"32_CR6","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/s00493-005-0013-7","volume":"25","author":"J. Geelen","year":"2005","unstructured":"Geelen, J., Iwata, S.: Matroid matching via mixed skew-symmetric matrices. Combinatorica\u00a025, 187\u2013215 (2005)","journal-title":"Combinatorica"},{"key":"32_CR7","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0024-3795(98)10210-0","volume":"288","author":"J.F. Geelen","year":"1999","unstructured":"Geelen, J.F.: Maximum rank matrix completion. Linear Algebra and Its Applications\u00a0288, 211\u2013217 (1999)","journal-title":"Linear Algebra and Its Applications"},{"key":"32_CR8","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/S0095-8956(03)00039-X","volume":"B88","author":"J.F. Geelen","year":"2003","unstructured":"Geelen, J.F., Iwata, S., Murota, K.: The linear delta-matroid parity problem. Journal of Combinatorial Theory\u00a0B88, 377\u2013398 (2003)","journal-title":"Journal of Combinatorial Theory"},{"key":"32_CR9","unstructured":"Harvey, N.J.A., Karger, D.R., Murota, K.: Deterministic network coding by matrix completion. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 489\u2013498 (2005)"},{"key":"32_CR10","doi-asserted-by":"crossref","unstructured":"Harvey, N.J.A., Karger, D.R., Yekhanin, S.: The complexity of matrix completion. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm, pp. 1103\u20131111 (2006)","DOI":"10.1145\/1109557.1109679"},{"key":"32_CR11","doi-asserted-by":"publisher","first-page":"4413","DOI":"10.1109\/TIT.2006.881746","volume":"52","author":"T. Ho","year":"2006","unstructured":"Ho, T., M\u00e9dard, M., Koetter, R., Karger, D.R., Effros, M., Shi, J., Leong, B.: A random linear network coding approach to multicast. IEEE Transactions on Information Theory\u00a052, 4413\u20134430 (2006)","journal-title":"IEEE Transactions on Information Theory"},{"key":"32_CR12","doi-asserted-by":"publisher","first-page":"3736","DOI":"10.1137\/090781231","volume":"39","author":"G. Ivanyos","year":"2010","unstructured":"Ivanyos, G., Karpinski, M., Saxena, N.: Deterministic polynomial time algorithms for matrix completion problems. SIAM Journal on Computing\u00a039, 3736\u20133751 (2010)","journal-title":"SIAM Journal on Computing"},{"key":"32_CR13","doi-asserted-by":"publisher","first-page":"782","DOI":"10.1109\/TNET.2003.818197","volume":"11","author":"R. Koetter","year":"2003","unstructured":"Koetter, R., M\u00e9dard, M.: An algebraic approach to network coding. IEEE\/ACM Transactions on Networking\u00a011, 782\u2013795 (2003)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"32_CR14","unstructured":"Lov\u00e1sz, L.: On determinants, matchings and random algorithms. In: Fundamentals of Computation Theory, FCT, pp. 565\u2013574 (1979)"},{"key":"32_CR15","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/BF02585470","volume":"20","author":"L. Lov\u00e1sz","year":"1989","unstructured":"Lov\u00e1sz, L.: Singular spaces of matrices and their application in combinatorics. Bulletin of the Brazilian Mathematical Society\u00a020, 87\u201399 (1989)","journal-title":"Bulletin of the Brazilian Mathematical Society"},{"key":"32_CR16","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1137\/0603009","volume":"1","author":"L. Lov\u00e1sz","year":"1982","unstructured":"Lov\u00e1sz, L., Yemini, Y.: On generic rigidity in the plane. SIAM Journal on Algebraic and Discrete Methods\u00a01, 91\u201398 (1982)","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"32_CR17","volume-title":"Matrices and Matroids for System Analysis","author":"K. Murota","year":"2009","unstructured":"Murota, K.: Matrices and Matroids for System Analysis, 2nd edn. Springer, Berlin (2009)","edition":"2"},{"key":"32_CR18","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1112\/jlms\/s2-2.2.251","volume":"S2","author":"D. Welsh","year":"1970","unstructured":"Welsh, D.: On matroid theorems of Edmonds and Rado. Journal of the London Mathematical Society\u00a0S2, 251\u2013256 (1970)","journal-title":"Journal of the London Mathematical Society"},{"key":"32_CR19","volume-title":"Information Theory and Network Coding","author":"R.W. Yeung","year":"2008","unstructured":"Yeung, R.W.: Information Theory and Network Coding. Springer, Berlin (2008)"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36694-9_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T17:47:39Z","timestamp":1557596859000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36694-9_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642366932","9783642366949"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36694-9_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}