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

Full description

Saved in:

Bibliographic Details
Published in:	Algorithmica Vol. 77; no. 4; pp. 1216 - 1239
Main Authors:	Chitnis, Rajesh, Esfandiari, Hossein, Hajiaghayi, MohammadTaghi, Khandekar, Rohit, Kortsarz, Guy, Seddighin, Saeed
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.04.2017 Springer Nature B.V
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!