Optimal Approximations for the Requirement Cut Problem on Sparse Graph Classes.

Nadym Mallek, Kirill Simonov

Browse the full SOFSEM paper archive.