A Tight Algorithm for Strongly Connected Steiner Subgraph On Two Terminals With Demands

Algorithmica, Volume abs/1506.03760, Issue 4, 2017, Pages 1216.0-1239.0.

Cited by: 3|Bibtex|Views43|Links
EI
Keywords:
FPT algorithmsDirected graphsStrongly connected Steiner subgraphExponential time hypothesis

Abstract:

Given an edge-weighted directed graph $G=(V,E)$G=(V,E) on n vertices and a set $T=\\{t_1, t_2, \\ldots , t_p\\}$T={t1,t2,¿,tp} of p terminals, the objective of the Strongly Connected Steiner Subgraph (p-SCSS) problem is to find an edge set $H\\subseteq E$H⊆E of minimum weight such that G[H] contains an $t_{i}\\rightarrow t_j$ti¿tj...More

Code:

Data:

Your rating :
0

 

Tags
Comments