A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands

Given an edge-weighted directed graph G = ( V , E ) on n vertices and a set T = { t 1 , t 2 , … , t p } of p terminals, the objective of the Strongly Connected Steiner Subgraph ( p -SCSS) problem is to find an edge set H ⊆ E of minimum weight such that G [ H ] contains an t i → t j path for each 1 ≤...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Algorithmica Jg. 77; H. 4; S. 1216 - 1239
Hauptverfasser:	Chitnis, Rajesh, Esfandiari, Hossein, Hajiaghayi, MohammadTaghi, Khandekar, Rohit, Kortsarz, Guy, Seddighin, Saeed
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.04.2017 Springer Nature B.V
Schlagworte:	Algorithm Analysis and Problem Complexity Algorithms Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Graph theory Graphs Integers Matching Mathematics of Computing Minimum weight Terminals Theory of Computation Tiling Weighting functions Exponential time hypothesis Directed graphs FPT algorithms Strongly connected Steiner subgraph
ISSN:	0178-4617, 1432-0541
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!