In this paper we introduce a variant of Reiter's hitting-set algorithm. Thi
s variant produces a hitting-set tree instead of an acyclic directed graph.
As an advantage some subset checks necessary for reducing the graph during
search can be avoided. (C) 2001 Elsevier Science B.V. All rights reserved.