On extended formulations for parameterized Steiner trees

Feldmann, A.E. orcid.org/0000-0001-6229-5332 and Rai, A. (2021) On extended formulations for parameterized Steiner trees. In: Golovach, P. A. and Zehavi, M., (eds.) Leibniz International Proceedings in Informatics, LIPIcs. 16th International Symposium on Parameterized and Exact Computation (IPEC 2021), 08-10 Sep 2021, Virtual event. Leibniz International Proceedings in Informatics, 214 . Schloss Dagstuhl - Leibniz-Zentrum , Dagstuhl, Germany , 18:1-18:16. ISBN 978-3-95977-216-7

Abstract

Metadata

Item Type: Proceedings Paper
Authors/Creators:
Editors:
  • Golovach, P. A.
  • Zehavi, M.
Copyright, Publisher and Additional Information:

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

Keywords: Steiner trees; integral linear program; extension complexity; fixed-parameter tractability
Dates:
  • Published: 22 November 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: 28 Jun 2023 11:33
Last Modified: 28 Jun 2023 12:00
Status: Published
Publisher: Schloss Dagstuhl - Leibniz-Zentrum
Series Name: Leibniz International Proceedings in Informatics
Refereed: Yes
Identification Number: 10.4230/LIPIcs.IPEC.2021.18
Related URLs:
Open Archives Initiative ID (OAI ID):

Export

Statistics