Minimization problems with non-submodular cover constraint (Q6542984)
From MaRDI portal
!
WARNING
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 7852518
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimization problems with non-submodular cover constraint |
scientific article; zbMATH DE number 7852518 |
Statements
Minimization problems with non-submodular cover constraint (English)
0 references
23 May 2024
0 references
approximation algorithm
0 references
submodular function
0 references
combinatorial optimization
0 references
greedy algorithm
0 references
primal-dual algorithm
0 references
0 references
0 references
0 references
0.8792338371276855
0 references
0.8670287728309631
0 references
0.8428878784179688
0 references
0.840202808380127
0 references
0.8397988080978394
0 references
