A note on optimal covering augmentation for graphic polymatroids. (Q1603399)
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 1767195
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on optimal covering augmentation for graphic polymatroids. |
scientific article; zbMATH DE number 1767195 |
Statements
A note on optimal covering augmentation for graphic polymatroids. (English)
0 references
14 July 2002
0 references
Algorithms
0 references
Combinatorial problems
0 references
Analysis of algorithms
0 references
Design of algorithms
0 references
Graph
0 references
Polymatroid
0 references
0 references
0.8371939063072205
0 references
0.8371939063072205
0 references
0.8350861668586731
0 references
0.7505300045013428
0 references
