Abstract
We consider the problem of 3-dimensional Discrete Tomography according to three linearly independent directions. Consistency of this problem has been proved to be NP-compete by M. Irving and R.W. Jerrum in 1993 [9] but there exists since 1976 a very close result of NP-hardness in the framework of Timetables which is due to S. Even, A. Itai, and A. Shamir [2]. The purpose of this paper is to provide a new result of NP-hardness for a very restricted class of 3D Discrete Tomography which is common with Timetables. Hence NP-hardness of 3D Discrete Tomography and of Timetables both follow from this new stronger result that we obtain with a short proof based on a generic principle.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chrobak, M., Dürr, C.: Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms. TCS 259(1-2), 81–98 (2001)
Even, S., Itai, A., Shamir, A.: On the complexity of timetable and multicommodity flow problems. SIAM J. Computing 5, 691–703 (1976)
Ford, L.R., Fulkerson, D.R.: Maximal flow through a network. Canadian Journal of Mathematics 8, 399–404 (1956)
Gale, D.: A theorem on flows in networks. Pacific J. Math. 7, 1073–1082 (1957)
Gardner, R.J., Gritzmann, P., Prangenberg, D.: On the computational complexity of determining polyatomic structures by X-rays. TCS 233(1-2), 91–106 (2000)
Gardner, R.J., Gritzmann, P., Prangenberg, D.: On the computational complexity of reconstructing lattice sets from their X-rays. Discrete Math. 202, 45–71 (1999)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)
Herman, G.T., Kuba, A.: Discrete Tomography: Foundations, Algorithms and Applications. Birkhäuser, Basel (1999)
Irving, M., Jerrum, R.W.: Three-dimensional statistical data security problems. SIAM Journal on Computing 23 (1993)
Ryser, H.J.: Combinatorial properties of zeros and ones. Canada J. Math. 9, 371–377 (1957)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gerard, Y. (2009). About the Complexity of Timetables and 3-Dimensional Discrete Tomography: A Short Proof of NP-Hardness. In: Wiederhold, P., Barneva, R.P. (eds) Combinatorial Image Analysis. IWCIA 2009. Lecture Notes in Computer Science, vol 5852. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10210-3_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-10210-3_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10208-0
Online ISBN: 978-3-642-10210-3
eBook Packages: Computer ScienceComputer Science (R0)