Parameterized Complexity of Arc-Weighted Directed Steiner Problems

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F09%3A10057129" target="_blank" >RIV/00216208:11320/09:10057129 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Parameterized Complexity of Arc-Weighted Directed Steiner Problems

Original language description

We initiate a systematic parameterized complexity study of three fundamental network design problems on arc-weighted directed graphs: Directed Steiner Tree, Strongly Connected Steiner Subgraph and Directed Steiner Network. We investigate their parameterized complexities with respect to the parameters "number of terminals", "an upper bound on the size of the connecting network", and the combination of both. We achieve several parameterized hardness as well as some fixed-parameter tractability results, inthis way significantly extending previous results of Feldman and Ruhl [SIAM J. Comp. 2006].

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

IN - Informatics

OECD FORD branch

—

Project

Result was created during the realization of more than one project. More information in the Projects tab.

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2009

Confidentiality

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

Article name in the collection

Algortihms and Computation, Proceedings

ISBN

978-3-642-10630-9

ISSN

0302-9743

e-ISSN

—

Number of pages

10

Pages from-to

—

Publisher name

Springer-Verlag

Place of publication

Berlin, Heidelberger Platz 3, Germany

Event location

Honolulu, HI, USA

Event date

Dec 16, 2009

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

000280382600054