Parameterized approximation algorithms for bidirected Steiner network problems

Chitnis, R., Feldmann, A.E. orcid.org/0000-0001-6229-5332 and Manurangsi, P. (2021) Parameterized approximation algorithms for bidirected Steiner network problems. ACM Transactions on Algorithms, 17 (2). ARTN 12. pp. 1-68. ISSN 1549-6325

Abstract

Metadata

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

© 2021 ACM. This is the author's version of the work. It is posted here for your personal use. Not for redistribution. The definitive Version of Record was published in ACM Transactions on Algorithms, http://dx.doi.org/10.1145/3447584

Keywords: Directed Steiner network; strongly connected Steiner subgraph; parameterized approximations; bidirected graphs; planar graphs
Dates:
  • Published: April 2021
  • Published (online): 19 April 2021
  • Accepted: 1 January 2021
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 14:51
Last Modified: 28 Jun 2023 09:08
Status: Published
Publisher: Association for Computing Machinery (ACM)
Refereed: Yes
Identification Number: 10.1145/3447584
Related URLs:
Open Archives Initiative ID (OAI ID):

Export

Statistics