On approximating cutwidth and pathwidth

DOI10.1109/FOCS61266.2024.00051MaRDI QIDQ7286921zbMATH OpenFDO

Authors N. Bansal, Roy Schwartz

Publication date 23 June 2026

Full work available at URL https://doi.org/10.1109/FOCS61266.2024.00051

Mathematics Subject Classification ID

Computer science (68-XX)

Cited in

(1)

• Exponential-time approximation (schemes) for vertex-ordering problems

This page was built for publication: On approximating cutwidth and pathwidth

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7286921)