版权所有:内蒙古大学图书馆 技术提供:维普资讯• 智图
内蒙古自治区呼和浩特市赛罕区大学西街235号 邮编: 010021
作者机构:Univ Trier FB Abt Informat 4 D-54286 Trier Germany
出 版 物:《INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS》 (国际计算机数学杂志)
年 卷 期:2010年第87卷第14期
页 面:3157-3174页
核心收录:
学科分类:07[理学] 070104[理学-应用数学] 0701[理学-数学]
主 题:Hitting Set problems parameterized algorithms analysis of search tree algorithms
摘 要:Based on the methodology we presented in earlier work on parameterized algorithms for 3-Hitting Set, we develop simple search tree-based algorithms for d-Hitting Set. We considerably improve on the bounds that were elsewhere derived for these problems.