An EPTAS for Max-Cut on Interval Graphs
cs.DS
Submitted: 2026-11-11
Updated: 2026-11-11
Code: https://github.com/anthropics/formal-math
Project page: https://lucatrevisan.github.io/pubs/cst-full.pdf
Terminology
Sources
- Maximum Cut on Interval Graphs of Interval Count Two is NP-complete
- Parameterized Approximation Schemes using Graph Widths
Related papers
- Exploiting Low Scanwidth to Resolve Soft Polytomies
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time