Conference
Jul 2026
Maximum Satisfiability of Simple Temporal Problems
The results suggest that MaxSTP is often computationally harder than optimizing qualitative CSPs - it is verified that many such problems are FPT when parameterized by n or tw, and it is demonstrated that FPT algorithms for MaxSTP are indeed possible but with other parameters such as k + vc.
J. Fichte, Johanna Groven, Peter Jonsson et al.
· Proceedings of the Thirty-Fi... · 0 citations