The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems

Given a directed graph \(G\) and a list \((s_1,t_1),\dots,(s_d,t_d)\) of terminal pairs, the Directed Steiner Network problem asks for a minimum-cost subgraph of \(G\) that contains a directed \(s_i\to t_i\) path for every \(1\le i \le k\). The special case Directed Steiner Tree (when we ask for pat...

Celý popis

Podrobná bibliografia

Vydané v:	arXiv.org
Hlavní autori:	Feldmann, Andreas Emil, Marx, Daniel
Médium:	Paper
Jazyk:	English
Vydavateľské údaje:	Ithaca Cornell University Library, arXiv.org 10.11.2022
Predmet:	Combinatorial analysis Complexity Decision trees Graph theory Graphs Parameters Polynomials Terminals
ISSN:	2331-8422
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!