default search action
"Nearly linear time approximations for mixed packing and covering problems ..."
Kent Quanrud (2020)
- Kent Quanrud:
Nearly linear time approximations for mixed packing and covering problems without data structures or randomization. SOSA 2020: 69-80
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.