The \textsc{Exact Subset MultiCover} problem
From MaRDI portal
Publication:6652461
DOI10.1016/J.TCS.2024.114936MaRDI QIDQ6652461
Guillaume Fertin, Géraldine Jean, Emile Benoist
Publication date: 12 December 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Parameterized complexity, tractability and kernelization (68Q27)
Cites Work
- Title not available (Why is that?)
- A simplified NP-complete satisfiability problem
- Understanding and using linear programming
- An application of simultaneous diophantine approximation in combinatorial optimization
- Which problems have strongly exponential complexity?
- Integer Programming with a Fixed Number of Variables
- Covering Problems with Hard Capacities
- Exact Algorithms for Set Multicover and Multiset Multicover Problems
- Reducibility among Combinatorial Problems
- Integer Linear Programming in Computational and Systems Biology
- On the complexity of \(k\)-SAT
This page was built for publication: The \textsc{Exact Subset MultiCover} problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6652461)
