On the reconstruction of binary and permutation matrices under (binary) tomographic constraints

Authors:
S. Brunetti;A. Del Lungo;P. Gritzmann;S. de Vries
Affiliations:
Dipartimento di Scienze Matematiche e Informatiche `R. Magari, Università di Siena, Pian dei Mantellin 44, 53100 Siena, Italy;-;Zentrum Mathematik, Technische Universität München, D-80290 München, Germany;Department of Operations, Faculty of Economics and Business, University of Groningen, P.O. Box 800, 9700 AV Groningen, The Netherlands
Venue:
Theoretical Computer Science
Year:
2008

Citing 6
Cited 2

A note on the queens' problem

Information Processing Letters
Three-Dimensional Statistical Data Security Problems

SIAM Journal on Computing
On the computational complexity of reconstructing lattice sets from their x-rays

Discrete Mathematics
On the algorithmic inversion of the discrete Radon transform

Theoretical Computer Science
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
On the Reconstruction of Finite Lattice Sets from their X-Rays

DGCI '97 Proceedings of the 7th International Workshop on Discrete Geometry for Computer Imagery

Uniqueness in Discrete Tomography: Three Remarks and a Corollary

SIAM Journal on Discrete Mathematics
Complexity results for reconstructing binary images with disjoint components from horizontal and vertical projections

Discrete Applied Mathematics

Quantified Score

Hi-index	5.23

Visualization

Abstract

The paper studies the problem of reconstructing binary matrices constrained by binary tomographic information. We prove new NP-hardness results that sharpen previous complexity results in the realm of discrete tomography but also allow applications to related problems for permutation matrices. Hence our results can be interpreted in terms of other combinatorial problems including the queens' problem.