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

Rajesh Chitnis, Hossein Esfandiari, MohammadTaghi Hajiaghayi +3

Given an edge-weighted directed graph $G=(V,E)$ on $n$ vertices and a set $T=\{t_1,t_2,\dots ,t_p\}$ of $p$ terminals, the objective of the \scss ($p$-SCSS) problem is to find a…