Polynomial-Time Data Reduction for the Subset Interconnection Design Problem
Polynomial-Time Data Reduction for the Subset Interconnection Design Problem
复制标题
子集互连设计问题的多项式时间数据缩减
DOI:
10.1137/140955057
复制
发表时间:
2015
期刊:
影响因子:
--
通讯作者:
und M. Weller
中科院分区:
文献类型:
--
作者:
J. Chen;C. Komusiewicz;R. Niedermeier;M. Sorge;O. Suchý;und M. Weller
The NP-hardSubset Interconnection Designproblem, also known asMinimum Topic-Connected Overlay, is motivated by numerous applications including the design of scalable overlay networks and vacuum systems. It has as input a finite setand a collection of subsets, and asks for a minimum-cardinality edge setsuch that for the graphall induced subgraphsare connected. We studySubset Interconnection Designin the context of polynomial-time data reduction rules that preserve the possibility of constructing optimal solutions. Our contribution is threefold: First, we show the incorrectness of earlier polynomial-time data reduction rules. Second, we show linear-time solvability in case of a constant numberof subsets, implying fixed-parameter tractability for the parameter. Third, we provide a fixed-parameter tractability result for small subset sizes and tree-like output graphs. To achieve our results, we elaborate on polynomial-time data reduction rules which also may be of practical use in solvingSubset Interconnection Design.
登录
查看更多内容
DOI:
--
发表时间:
2008
期刊:
International Conference on Combinatorial Optimization and Applications
影响因子:
--
作者:
Hongbing Fan;Christian Rosenke;Yu;Jason B. Ernst
通讯作者:
Jason B. Ernst
影响因子:
0.8
作者:
D. Du;Zevi Miller
通讯作者:
Zevi Miller
DOI:
--
发表时间:
1995
期刊:
影响因子:
--
作者:
Xuyinfeng;Fuxiaobing
通讯作者:
Fuxiaobing
DOI:
--
发表时间:
2008
期刊:
International Conference on Foundations of Computer Science
影响因子:
--
作者:
Hongbing Fan;Yu
通讯作者:
Yu
影响因子:
2.7
作者:
Korach, E;Stern, M
通讯作者:
Stern, M