All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Polynomial-time Data Reduction for the Subset Interconnection Design Problem

The result's identifiers

  • Result code in 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>

  • Result on the web

    <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>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Polynomial-time Data Reduction for the Subset Interconnection Design Problem

  • Original language description

    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.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GP14-13017P" target="_blank" >GP14-13017P: Parameterized Algorithms for Fundamental Network Problems Related to Connectivity</a><br>

  • Continuities

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

Others

  • Publication year

    2015

  • Confidentiality

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

Data specific for result type

  • Name of the periodical

    SIAM Journal on Discrete Mathematics

  • ISSN

    0895-4801

  • e-ISSN

  • Volume of the periodical

    29

  • Issue of the periodical within the volume

    1

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    25

  • Pages from-to

    1-25

  • UT code for WoS article

    000352224600001

  • EID of the result in the Scopus database

    2-s2.0-84925362645