A variant of Reiter's hitting-set algorithm

Authors
Citation
F. Wotawa, A variant of Reiter's hitting-set algorithm, INF PROCESS, 79(1), 2001, pp. 45-51
Citations number
14
Categorie Soggetti
Information Tecnology & Communication Systems
Journal title
INFORMATION PROCESSING LETTERS
ISSN journal
00200190 → ACNP
Volume
79
Issue
1
Year of publication
2001
Pages
45 - 51
Database
ISI
SICI code
0020-0190(20010531)79:1<45:AVORHA>2.0.ZU;2-A
Abstract
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.