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

Kent Quanrud

Browse the full SODA paper archive.