Nearly linear time approximations for mixed packing and covering problems without data structures or randomization (Q6538733)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Nearly linear time approximations for mixed packing and covering problems without data structures or randomization |
scientific article; zbMATH DE number 7848162
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Nearly linear time approximations for mixed packing and covering problems without data structures or randomization |
scientific article; zbMATH DE number 7848162 |
Statements
Nearly linear time approximations for mixed packing and covering problems without data structures or randomization (English)
0 references
14 May 2024
0 references
