Online Submodular Maximization Problem with Vector Packing Constraint. (Q5111710)
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: Online Submodular Maximization Problem with Vector Packing Constraint. |
scientific article; zbMATH DE number 7205002
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Online Submodular Maximization Problem with Vector Packing Constraint. |
scientific article; zbMATH DE number 7205002 |
Statements
27 May 2020
0 references
submodular maximization
0 references
free-disposal
0 references
vector packing
0 references
0 references
0 references
0 references
Online Submodular Maximization Problem with Vector Packing Constraint. (English)
0 references
0 references
0.8994896
0 references
0.8985374
0 references
0.8981849
0 references
0.8981849
0 references
0 references
0.88872457
0 references
0.88659966
0 references
0.88521045
0 references
