NDLI: The Minimal Hitting Set Generation Problem: Algorithms and Computation

Content Provider	Society for Industrial and Applied Mathematics (SIAM)
Author	Gainer-Dewar, Andrew Vera-Licona, Paola
Copyright Year	2017
Abstract	Finding inclusion-minimal hitting sets (MHSs) for a given family of sets is a fundamental combinatorial problem with applications in domains as diverse as Boolean algebra, computational biology, and data mining. Although many algorithms are available in the literature to generate these MHSs, application papers typically consider only a few before selecting one (or introducing a novel algorithm), suggesting the need for a comprehensive survey and performance comparison. We introduce several of these applications, discussing how MHS generation is applied in each domain and which algorithms have been used, providing a unified view of these applications for researchers from diverse areas. We survey twenty-one algorithms for MHS generation from across a variety of domains, considering their history, classification, and useful features. We provide the results of a comprehensive suite of benchmarks of public software implementations of seventeen of these algorithms, including six we implemented ourselves in C++, emphasizing problem instances taken from real applications in the literature. We find that the fastest algorithms in practice are not those with the tightest complexity bounds or those most commonly used in applications, suggesting that, for a given application, benchmarking from across the broad span of available algorithms will enable a better choice. Finally, we provide a public repository of these software implementations as ready-to-use, platform-agnostic Docker containers based on the AlgoRun framework, so interested computational scientists can easily perform similar tests with inputs from their own research areas, either on their own computers or through a convenient Web interface or deploy the algorithms in their own analysis pipelines.
Starting Page	63
Ending Page	100
Page Count	38
File Format	PDF
ISSN	08954801
DOI	10.1137/15M1055024
e-ISSN	10957146
Journal	SIAM Journal on Discrete Mathematics (SJDMEC)
Issue Number	1
Volume Number	31
Language	English
Publisher	Society for Industrial and Applied Mathematics
Publisher Date	2017-01-03
Access Restriction	Subscribed
Subject Keyword	minimal hitting set Nonnumerical algorithms combinatorial algorithms hypergraph transversal Boolean dualization set cover problem Graph algorithms Combinatorics
Content Type	Text
Resource Type	Article
Subject	Mathematics

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

New Results on Monotone Dualization and Generating Hypergraph Transversals

On the Enumeration of Minimal Dominating Sets and Related Notions

Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph

The minimal hitting set generation problem: algorithms and computation

New results on monotone dualization and generating hypergraph transversals

A Worst-Case Analysis of the Sequential Method to List the Minimal Hitting Sets of a Hypergraph

Left-to-Right Multiplication for Monotone Boolean Dualization

Symbolic Learning for Improving the Performance of Transversal-Computation Algorithms

Beyond Hypergraph Dualization

The Minimal Hitting Set Generation Problem: Algorithms and Computation

Similar Documents

New Results on Monotone Dualization and Generating Hypergraph Transversals

On the Enumeration of Minimal Dominating Sets and Related Notions

Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph

The minimal hitting set generation problem: algorithms and computation

New results on monotone dualization and generating hypergraph transversals

A Worst-Case Analysis of the Sequential Method to List the Minimal Hitting Sets of a Hypergraph

Left-to-Right Multiplication for Monotone Boolean Dualization

Symbolic Learning for Improving the Performance of Transversal-Computation Algorithms

Beyond Hypergraph Dualization

The Minimal Hitting Set Generation Problem: Algorithms and Computation