On MAX–SAT with cardinality constraint

Panolan, F. orcid.org/0000-0001-6213-8687 and Yaghoubizade, H. (2025) On MAX–SAT with cardinality constraint. Theoretical Computer Science, 1025. 114971. 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: Parameterized algorithms, Approximation algorithms, MAX–SAT, MAX–2SAT
Dates:
  • Published: 2 February 2025
  • Published (online): 14 November 2024
  • Accepted: 11 November 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:29
Last Modified: 04 Jan 2025 14:19
Published Version: https://www.sciencedirect.com/science/article/pii/...
Status: Published
Publisher: Elsevier
Identification Number: 10.1016/j.tcs.2024.114971
Related URLs:
Open Archives Initiative ID (OAI ID):

Download

Export

Statistics


CORE (COnnecting REpositories)