Parameterized approximation algorithms for bidirected steiner network problems

Chitnis, R., Feldmann, A.E. orcid.org/0000-0001-6229-5332 and Manurangsi, P. (2018) Parameterized approximation algorithms for bidirected steiner network problems. In: Azar, Y., Bast, H. and Herman, G., (eds.) Leibniz International Proceedings in Informatics, LIPIcs. 26th Annual European Symposium on Algorithms (ESA 2018), 20-24 Aug 2018, Helsinki, Finland. Leibniz International Proceedings in Informatics, 112 . Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik , Dagstuhl, Germany ISBN 978-3-95977-081-1

Abstract

Metadata

Item Type: Proceedings Paper
Authors/Creators:
Editors:
  • Azar, Y.
  • Bast, H.
  • Herman, G.
Copyright, Publisher and Additional Information:

© 2018 The Authors. This is an Open Access article distributed under the terms of the Creative Commons Attribution Licence (https://creativecommons.org/licenses/by/3.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Keywords: Directed Steiner Network; Strongly Connected Steiner Subgraph; Parameterized Approximations; Bidirected Graphs; Planar Graphs
Dates:
  • Published: 14 August 2018
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: 28 Jun 2023 14:28
Last Modified: 28 Jun 2023 14:28
Status: Published
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
Series Name: Leibniz International Proceedings in Informatics
Refereed: Yes
Identification Number: 10.4230/LIPIcs.ESA.2018.20
Related URLs:
Open Archives Initiative ID (OAI ID):

Export

Statistics