A simple deterministic algorithm for symmetric submodular maximization subject to a knapsack constraint (Q2203598)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7256108
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simple deterministic algorithm for symmetric submodular maximization subject to a knapsack constraint |
scientific article; zbMATH DE number 7256108 |
Statements
A simple deterministic algorithm for symmetric submodular maximization subject to a knapsack constraint (English)
0 references
7 October 2020
0 references
approximation algorithms
0 references
submodular maximization
0 references
symmetric submodular functions
0 references
knapsack constraints
0 references
0 references
0 references
0 references
0 references
0 references
0.8437448143959045
0 references
0.841701328754425
0 references
0.8384270071983337
0 references
