Faster approximation algorithms for maximizing a monotone submodular function subject to a \(b\)-matching constraint (Q284354)
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: Faster approximation algorithms for maximizing a monotone submodular function subject to a \(b\)-matching constraint |
scientific article; zbMATH DE number 6581518
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Faster approximation algorithms for maximizing a monotone submodular function subject to a \(b\)-matching constraint |
scientific article; zbMATH DE number 6581518 |
Statements
Faster approximation algorithms for maximizing a monotone submodular function subject to a \(b\)-matching constraint (English)
0 references
18 May 2016
0 references
approximation algorithms
0 references
submodular function
0 references
\(b\)-matching
0 references
