Title :
An Exact Fast Algorithm for Minimum Hitting Set
Author :
Shi, Lei ; Cai, Xuan
Author_Institution :
Shanghai Jiao Tong Univ., Shanghai, China
Abstract :
We propose a branch-and-reduce algorithm to solve the Minimum Hitting Set Problem in this paper and use a recently developed technique called measure and conquer to perform analysis on the algorithm. By applying such technique and quasiconvex programming when optimizing the analysis results, we prove that our algorithm can solve the Minimum Hitting Set Problem in O(1.23801n) and polynomial space.
Keywords :
computational complexity; convex programming; set theory; tree searching; branch-and-reduce algorithm; measure-and-conquer technique; minimum hitting set problem; polynomial space; quasiconvex programming; Algorithm design and analysis; Extraterrestrial measurements; NP-hard problem; Performance analysis; Performance evaluation; Polynomials; Security; Size measurement; Time measurement; Upper bound; exact algorithm; measure and conquer; minimum hitting set; quasiconvex programming;
Conference_Titel :
Computational Science and Optimization (CSO), 2010 Third International Joint Conference on
Conference_Location :
Huangshan, Anhui
Print_ISBN :
978-1-4244-6812-6
Electronic_ISBN :
978-1-4244-6813-3
DOI :
10.1109/CSO.2010.240
