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

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)