Optimal Approximations for the Requirement Cut Problem on Sparse Graph Classes

Lecture notes in computer science 2026 Open access

Read full text

Authors: Nadym Mallek, Kirill Simonov

DOI: 10.1007/978-3-032-17801-5_40

Cited by: 0

References: 39

Fields of Study & Subjects

Complexity and Algorithms in Graphs Advanced Graph Theory Research Computational Geometry and Mesh Generation

References 39