An efficient algorithm for minimizing M-convex functions under a color-induced budget constraint (Q6161898)
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 7703344
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient algorithm for minimizing M-convex functions under a color-induced budget constraint |
scientific article; zbMATH DE number 7703344 |
Statements
An efficient algorithm for minimizing M-convex functions under a color-induced budget constraint (English)
0 references
28 June 2023
0 references
matroid intersection
0 references
generalized polymatroid
0 references
nonseparable discrete convex function
0 references
polynomial algorithm
0 references
0 references
0.79127436876297
0 references
0.7715240716934204
0 references
0.76231449842453
0 references
0.76011723279953
0 references
