Success and failure of certain reconstruction and uniqueness algorithms in discrete tomography

At the conference on discrete tomography in Szeged, 24-27 August, 1997, various algorithms were presented for reconstructing and deciding (partial) uniqueness of finite lattice sets that are given by their discrete X-rays in a number m of directions. The present article discusses such procedures from the point of view of their worst-case running time and their approximation error.