Polynomial-time Data Reduction for the Subset Interconnection Design Problem

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F15%3A00237615" target="_blank" >RIV/68407700:21240/15:00237615 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1137/140955057" target="_blank" >http://dx.doi.org/10.1137/140955057</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1137/140955057" target="_blank" >10.1137/140955057</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Polynomial-time Data Reduction for the Subset Interconnection Design Problem

Popis výsledku v původním jazyce

The NP-hard textsc{Subset Interconnection Design} problem, also known as textsc{Minimum Topic-Connected Overlay}, is motivated by numerous applications including the design of scalable overlay networks and vacuum systems. It has as input a finite set~$V$and a collection of subsets $V_1, V_2, ldots, V_m subseteq V$, and asks for a minimum-cardinality edge set~$E$ such that for the graph $G=(V,E)$ all induced subgraphs $G[V_1], G[V_2], ldots, G[V_m]$ are connected. We study textsc{Subset InterconnectionDesign} in the context of polynomial-time data reduction rules that preserve the possibility to construct optimal solutions. Our contribution is threefold: First, we show the incorrectness of earlier polynomial-time data reduction rules. Second, we showlinear-time solvability in case of a constant number~$m$ of subsets, implying fixed-parameter tractability for the parameter~$m$. Third, we provide a fixed-parameter tractability result for small subset sizes and tree-like output graphs.

Název v anglickém jazyce

Polynomial-time Data Reduction for the Subset Interconnection Design Problem

Popis výsledku anglicky

The NP-hard textsc{Subset Interconnection Design} problem, also known as textsc{Minimum Topic-Connected Overlay}, is motivated by numerous applications including the design of scalable overlay networks and vacuum systems. It has as input a finite set~$V$and a collection of subsets $V_1, V_2, ldots, V_m subseteq V$, and asks for a minimum-cardinality edge set~$E$ such that for the graph $G=(V,E)$ all induced subgraphs $G[V_1], G[V_2], ldots, G[V_m]$ are connected. We study textsc{Subset InterconnectionDesign} in the context of polynomial-time data reduction rules that preserve the possibility to construct optimal solutions. Our contribution is threefold: First, we show the incorrectness of earlier polynomial-time data reduction rules. Second, we showlinear-time solvability in case of a constant number~$m$ of subsets, implying fixed-parameter tractability for the parameter~$m$. Third, we provide a fixed-parameter tractability result for small subset sizes and tree-like output graphs.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/GP14-13017P" target="_blank" >GP14-13017P: Parametrizované algoritmy pro základní síťové problémy spojené se souvislostí</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2015

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

SIAM Journal on Discrete Mathematics

ISSN

0895-4801

e-ISSN

—

Svazek periodika

29

Číslo periodika v rámci svazku

1

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

25

Strana od-do

1-25

Kód UT WoS článku

000352224600001

EID výsledku v databázi Scopus

2-s2.0-84925362645