Abstract
The feedback vertex set problem for hypergraphs is considered and an efficient approximation algorithm is presented. It is shown that an approximation factor of k is guaranteed when the cardinality of every hyperedge is bounded by an integer k, generalizing the existing result for ordinary graphs.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have