The complexity landscape of fixed-parameter Directed Steiner Network problems

Feldmann, A.E. orcid.org/0000-0001-6229-5332 and Marx, D. (2023) The complexity landscape of fixed-parameter Directed Steiner Network problems. ACM Transactions on Computation Theory, 15 (3-4). ISSN 1942-3454

Abstract

Metadata

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

© 2023 Copyright held by the owner/author(s). This is an author-produced version of a paper subsequently published in ACM Transactions on Computation Theory. Uploaded in accordance with the publisher's self-archiving policy.

Dates:
  • Published: December 2023
  • Published (online): 6 June 2023
  • Accepted: 12 January 2023
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:57
Last Modified: 03 Oct 2024 15:13
Status: Published
Publisher: Association for Computing Machinery (ACM)
Refereed: Yes
Identification Number: 10.1145/3580376
Related URLs:
Open Archives Initiative ID (OAI ID):

Export

Statistics