Nearly linear time approximations for mixed packing and covering problems without data structures or randomization

DOI10.1137/1.9781611976014.11MaRDI QIDQ6538733FDOQ6538733

Authors: Kent Quanrud 

Publication date: 14 May 2024

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

This page was built for publication: Nearly linear time approximations for mixed packing and covering problems without data structures or randomization

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