The feedback vertex set problem for hypergraphs is considered and an effici
ent approximation algorithm is presented. It is shown that an approximation
factor of k is guaranteed when the cardinality of every hyperedge is bound
ed by an integer k, generalizing the existing result for ordinary graphs. (
C) 2000 Elsevier Science B.V. All rights reserved.