On the Exact & Approximate Complexity of the Strongly Connected Steiner Subgraph Problem on Two Terminals with Demands.

Kevin Kurien Alex, Rajesh Chitnis, Alex Tempest

Browse the full FCT paper archive.