TY - GEN

T1 - Effective and efficient data reduction for the subset interconnection design problem

AU - Chen, Jiehua

AU - Komusiewicz, Christian

AU - Niedermeier, Rolf

AU - Sorge, Manuel

AU - Suchý, Ondřej

AU - Weller, Mathias

N1 - Funding Information:
JC was supported by Studienstiftung des Deutschen Volkes, MS and MW were supported by Deutsche Forschungsgemeinschaft (projects NI 369/12 and NI 369/9), and part of the work of OS and MW was done while they were affiliated with TU Berlin.

PY - 2013/12/1

Y1 - 2013/12/1

N2 - The NP-hard Subset Interconnection Design problem is motivated by applications in designing vacuum systems and scalable overlay networks. It has as input a set V and a collection of subsets V1, V2,..., Vm , and asks for a minimum-cardinality edge set E such that for the graph G = (V,E) all induced subgraphs G[V1], G[V2],..., G[Vm ] are connected. It has also been studied under the name Minimum Topic-Connected Overlay. We study Subset Interconnection Design in the context of polynomial-time data reduction rules that preserve optimality. Our contribution is threefold: First, we point out flaws in earlier polynomial-time data reduction rules. Second, we provide a fixed-parameter tractability result for small subset sizes and tree-like output graphs. Third, we show linear-time solvability in case of a constant number m of subsets, implying fixed-parameter tractability for the parameter m. To achieve our results, we elaborate on polynomial-time data reduction rules (partly "repairing" previous flawed ones) which also may be of practical use in solving Subset Interconnection Design.

AB - The NP-hard Subset Interconnection Design problem is motivated by applications in designing vacuum systems and scalable overlay networks. It has as input a set V and a collection of subsets V1, V2,..., Vm , and asks for a minimum-cardinality edge set E such that for the graph G = (V,E) all induced subgraphs G[V1], G[V2],..., G[Vm ] are connected. It has also been studied under the name Minimum Topic-Connected Overlay. We study Subset Interconnection Design in the context of polynomial-time data reduction rules that preserve optimality. Our contribution is threefold: First, we point out flaws in earlier polynomial-time data reduction rules. Second, we provide a fixed-parameter tractability result for small subset sizes and tree-like output graphs. Third, we show linear-time solvability in case of a constant number m of subsets, implying fixed-parameter tractability for the parameter m. To achieve our results, we elaborate on polynomial-time data reduction rules (partly "repairing" previous flawed ones) which also may be of practical use in solving Subset Interconnection Design.

UR - http://www.scopus.com/inward/record.url?scp=84893364071&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-45030-3_34

DO - 10.1007/978-3-642-45030-3_34

M3 - Conference contribution

AN - SCOPUS:84893364071

SN - 9783642450297

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 361

EP - 371

BT - Algorithms and Computation - 24th International Symposium, ISAAC 2013, Proceedings

T2 - 24th International Symposium on Algorithms and Computation, ISAAC 2013

Y2 - 16 December 2013 through 18 December 2013

ER -