Max-SAT with Cardinality Constraint Parameterized by the Number of Clauses

Jain, P., Kanesh, L., Panolan, F. orcid.org/0000-0001-6213-8687 et al. (4 more authors) (2024) Max-SAT with Cardinality Constraint Parameterized by the Number of Clauses. In: Soto, J.A. and Wiese, A., (eds.) Proceedings of Latin American Theoretical Informatics (LATIN 2024). Latin American Theoretical Informatics (LATIN 2024), 18-22 Mar 2024, Puerto Varas, Chile. Lecture Notes in Computer Science . Springer Nature , pp. 223-237. ISBN 978-3-031-55601-2

Metadata

Item Type: Proceedings Paper
Authors/Creators:
Editors:
  • Soto, J.A.
  • Wiese, A.
Copyright, Publisher and Additional Information:

© The Author(s) 2024. This version of the chapter has been accepted for publication, after peer review (when applicable) and is subject to Springer Nature’s AM terms of use (https://www.springernature.com/gp/open-research/policies/accepted-manuscript-terms), but is not the Version of Record and does not reflect post-acceptance improvements, or any corrections. The Version of Record is available online at: http://dx.doi.org/10.1007/978-3-031-55601-2_15
Dates:
  • Accepted: 15 December 2023
  • Published (online): 6 March 2024
  • Published: 5 March 2024
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds)
Depositing User: Symplectic Publications
Date Deposited: 26 Jan 2024 12:15
Last Modified: 08 May 2025 09:54
Status: Published
Publisher: Springer Nature
Series Name: Lecture Notes in Computer Science
Identification Number: 10.1007/978-3-031-55601-2_15
Open Archives Initiative ID (OAI ID):

Export

Statistics


CORE (COnnecting REpositories)