Tight bounds for planar strongly connected steiner subgraph with fixed number of terminals (and extensions)

Chitnis, R.H. orcid.org/0000-0002-6098-7770, Feldmann, A.E. orcid.org/0000-0001-6229-5332, HajiAghayi, M.T. et al. (1 more author) (2020) Tight bounds for planar strongly connected steiner subgraph with fixed number of terminals (and extensions). SIAM Journal on Computing, 49 (2). pp. 318-364. ISSN 0097-5397

Abstract

Metadata

Item Type: Article
Authors/Creators:
Copyright, Publisher and Additional Information:

© 2020, Society for Industrial and Applied Mathematics. This is an author-produced version of a paper subsequently published in SIAM Journal on Computing . Uploaded in accordance with the publisher's self-archiving policy.

Keywords: strongly connected Steiner subgraph; FPT algorithms; directed Steiner network; exponential time hypothesis; planar graphs
Dates:
  • Published: January 2020
  • Published (online): 25 March 2020
  • Accepted: 25 November 2019
Institution: The University of Sheffield
Academic Units: The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Computer Science (Sheffield)
Depositing User: Symplectic Sheffield
Date Deposited: 27 Jun 2023 15:09
Last Modified: 28 Jun 2023 09:29
Status: Published
Publisher: Society for Industrial & Applied Mathematics (SIAM)
Refereed: Yes
Identification Number: 10.1137/18m122371x
Related URLs:
Open Archives Initiative ID (OAI ID):

Export

Statistics