Effective and efficient data reduction for the subset interconnection design problem

Jiehua Chen, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Ondřej Suchý, Mathias Weller

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publicationAlgorithms and Computation - 24th International Symposium, ISAAC 2013, Proceedings
Pages361-371
Number of pages11
DOIs
StatePublished - 1 Dec 2013
Externally publishedYes
Event24th International Symposium on Algorithms and Computation, ISAAC 2013 - Hong Kong, China
Duration: 16 Dec 201318 Dec 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8283 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference24th International Symposium on Algorithms and Computation, ISAAC 2013
Country/TerritoryChina
CityHong Kong
Period16/12/1318/12/13

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'Effective and efficient data reduction for the subset interconnection design problem'. Together they form a unique fingerprint.

Cite this