Smaller Kernels for Hitting Set Problems of Constant Arity
LECTURE NOTES IN COMPUTER SCIENCE(2004)
摘要
We demonstrate a kernel of size O(k(2)) for 3-HITTING SET (HITTING SET when all subsets in the collection to be hit are of size at most three), giving a partial answer to an open question of Niedermeier by improving on the O(k(3)) kernel of Niedermeier and Rossmanith. Our technique uses the Nenihauser-Trotter linear-size kernel for VERTEX COVER, and generalizes to demonstrating a kernel of size O(k(r-1)) for r-HITTING SET (for fixed r).
更多查看译文
关键词
hitting set,fixed parameter algorithms,kernels
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络