Optimal Approximations for the Requirement Cut Problem on Sparse Graph Classes

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Mallek, Nadym, Simonov, Kirill
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2505.21433