Fast approximation of matroid packing and covering (Q1730564)
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 7032608
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast approximation of matroid packing and covering |
scientific article; zbMATH DE number 7032608 |
Statements
Fast approximation of matroid packing and covering (English)
0 references
6 March 2019
0 references
approximation algorithm
0 references
matroid
0 references
multiplicative-weights-update method
0 references
Kruskal algorithm
0 references
strength and arboricity of graph
0 references
job scheduling
0 references
0 references
0 references
0.8328803777694702
0 references
0.7903907299041748
0 references
0.784220814704895
0 references
0.784220814704895
0 references
