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”

Effective and Efficient 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%2F13%3A00209351" target="_blank" >RIV/68407700:21240/13:00209351 - isvavai.cz</a>

  • Result on the web

    <a href="http://link.springer.com/chapter/10.1007%2F978-3-642-45030-3_34" target="_blank" >http://link.springer.com/chapter/10.1007%2F978-3-642-45030-3_34</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-642-45030-3_34" target="_blank" >10.1007/978-3-642-45030-3_34</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Effective and Efficient Data Reduction for the Subset Interconnection Design Problem

  • Original language description

    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 Esuch 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? p

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2013

  • 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

  • Article name in the collection

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

  • ISBN

    978-3-642-45029-7

  • ISSN

    0302-9743

  • e-ISSN

  • Number of pages

    11

  • Pages from-to

    361-371

  • Publisher name

    Springer Science+Business Media

  • Place of publication

    Berlin

  • Event location

    Hong Kong

  • Event date

    Dec 16, 2013

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article