Abstract
We investigate a natural generalization of the problem of reconstruction of a binary matrix A with prescribed row and column sums: we consider an integer matrix whose list of coefficients is given in the input. The question is to organize the coefficients in the matrix in order to obtain prescribed row and column sums. We prove that this problem is NP-complete by reducing it to a 2D problem of Discrete Tomography with 3 directions of projections.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Brualdi, R.: Combinatorial Matrix Theory. Cambridge University Press, Cambridge (1991)
Brunetti, S., Lungo, A.D., Gerard, Y.: On the computational complexity of reconstructing three-dimensional lattice sets from their two dimensional x-rays. Journal of Linear Algebra and Application 339(1-3), 59–73 (2001)
Chrobak, M., Durr, C.: Reconstructing polyatomic structures from discrete x-rays: Np-completeness proof for three atoms. Theoretical Computer Science 259, 81–98 (2001)
Even, S., Itai, A., Shamir, A.: On the complexity of timetable and multicommodity flow problems. SIAM Journal of Computing 5, 691–703 (1976)
Gale, D.: A theorem on flows in networks. Pacific Journal of Mathematics 7, 1073–1082 (1957)
Gardner, R.J.: Geometric Tomography. Encyclopedia of Mathematics and Its Applications, vol. 58. Cambridge University Press, Cambridge (1995)
Gardner, R.J., Gritzmann, P., Prangenberg, D.: On the computational complexity of determining polyatomic structures by x-rays. Theoretical Computer Science 233(1-2), 91–106 (2000)
Gritzmann, P.: On the reconstruction of finite lattice sets from their x-rays. In: Ahronovitz, E. (ed.) DGCI 1997. LNCS, vol. 1347, pp. 19–32. Springer, Heidelberg (1997)
Herman, G., Kuba, A.: Discrete Tomography: Foundations, Algorithms and Applications. Applied and Numerical Harmonic Analysis. Birkhaüser (1999)
Irving, M., Jerrum, R.: Three-dimensional statistical data security problems. SIAM Journal on Computing 23, 166–184 (1993)
Kong, T., Herman, G.: On which grids can tomographic equivalence of binary pictures be characterized in terms of elementary switching operations? International Journal of Imaging Systems and Technology 9, 118–125 (1998)
Ryser, H.: Combinatorial properties of matrices of zeros and ones. Canadian Journal of Mathematics 9, 371–377 (1957)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gerard, Y. (2008). Reconstructing a Matrix with a Given List of Coefficients and Prescribed Row and Column Sums Is NP-Hard. In: Brimkov, V.E., Barneva, R.P., Hauptman, H.A. (eds) Combinatorial Image Analysis. IWCIA 2008. Lecture Notes in Computer Science, vol 4958. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78275-9_32
Download citation
DOI: https://doi.org/10.1007/978-3-540-78275-9_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78274-2
Online ISBN: 978-3-540-78275-9
eBook Packages: Computer ScienceComputer Science (R0)