Evaluation of an Algorithm for the Transversal Hypergraph Problem
نویسندگان
چکیده
The Transversal Hypergraph Problem is the problem of computing, given a hypergraph, the set of its minimal transversals, i.e. the hypergraph whose hyperedges are all minimal hitting sets of the given one. This problem turns out to be central in various fields of Computer Science. We present and experimentally evaluate a heuristic algorithm for the problem, which seems able to handle large instances and also possesses some nice features especially desirable in problems with large output such as the Transversal Hypergraph Problem.
منابع مشابه
An Efficient Algorithm for the Transversal Hypergraph Generation
The Transversal Hypergraph Generation is the problem of generating, given a hypergraph, the set of its minimal transversals, i.e., the hypergraph whose hyperedges are the minimal hitting sets of the given one. The purpose of this paper is to present an efficient and practical algorithm for solving this problem. We show that the proposed algorithm operates in a way that rules out regeneration an...
متن کاملAn efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation
Given a finite set V , and a hypergraph H ⊆ 2 , the hypergraph transversal problem calls for enumerating all minimal hitting sets (transversals) for H. This problem plays an important role in practical applications as many other problems were shown to be polynomially equivalent to it. Fredman and Khachiyan (1996) gave an incremental quasi-polynomial time algorithm for solving the hypergraph tra...
متن کاملIdentifying the Minimal Transversals of a Hypergraph and Related Problems
The paper considers two decision problems on hypergraphs, hypergraph saturation and recognition of the transversal hypergraph, and discusses their significance for several search problems in applied computer science. Hypergraph saturation, i.e., given a hypergraph H, decide if every subset of vertices is contained in or contains some edge of H, is shown to be co-NP-complete. A certain subproble...
متن کاملOn the dynamic stability of a flying vehicle under the follower and transversal forces
This paper deals with the problem of the instability regions of a free-free uniform Bernoulli beam consisting of two concentrated masses at the two free ends under the follower and transversal forces as a model for a space structure. The follower force is the model for the propulsion force and the transversal force is the controller force. The main aim of this study is to analyze the effects of...
متن کاملA New Algorithm for the Transversal Hypergraph Problem
The Transversal Hypergraph Problem is the problem of generating, given a hyper-graph, the set of its transversals, i.e. the hypergraph whose hyperedges are all minimal hitting sets of the given one. This problem turns out to be central in various elds of Computer Science. In this paper we present and experimentally evaluate a new heuristic algorithm for the problem. Experimental results show th...
متن کامل