"On the Exact & Approximate Complexity of the Strongly Connected ..."

Kevin Kurien Alex, Rajesh Chitnis, Alex Tempest (2025)

> Home

Details and statistics

DOI: 10.1007/978-3-032-04700-7_3

access: closed

type: Conference or Workshop Paper

metadata version: 2025-10-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/fct/AlexCT25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fct/AlexCT25
Kevin Kurien Alex, Rajesh Chitnis, Alex Tempest:
On the Exact & Approximate Complexity of the Strongly Connected Steiner Subgraph Problem on Two Terminals with Demands. FCT 2025: 30-44

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.