Parameterized algorithms for minimum sum vertex cover

Aute, S. orcid.org/0009-0000-2964-0368 and Panolan, F. orcid.org/0000-0001-6213-8687 (2025) Parameterized algorithms for minimum sum vertex cover. Theoretical Computer Science, 1029. 115032. ISSN 0304-3975

Metadata

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

This is an author produced version of an article published in Theoretical Computer Science, made available under the terms of the Creative Commons Attribution License (CC-BY), which permits unrestricted use, distribution and reproduction in any medium, provided the original work is properly cited.
Keywords: FPT, Vertex cover, Integer quadratic programming
Dates:
  • Published: 2 March 2025
  • Published (online): 17 December 2024
  • Accepted: 13 December 2024
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) > Algorithms & Complexity
Depositing User: Symplectic Publications
Date Deposited: 03 Jan 2025 14:49
Last Modified: 06 Jan 2025 12:32
Published Version: https://www.sciencedirect.com/science/article/pii/...
Status: Published
Publisher: Elsevier
Identification Number: 10.1016/j.tcs.2024.115032
Open Archives Initiative ID (OAI ID):

Export

Statistics


CORE (COnnecting REpositories)