Efficient constructions of convex combinations for 2-edge-connected subgraphs on fundamental classes (Q2067494)
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: Efficient constructions of convex combinations for 2-edge-connected subgraphs on fundamental classes |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient constructions of convex combinations for 2-edge-connected subgraphs on fundamental classes |
scientific article |
Statements
Efficient constructions of convex combinations for 2-edge-connected subgraphs on fundamental classes (English)
0 references
18 January 2022
0 references
2-edge-connected multigraph
0 references
convex combination
0 references
integrality gap
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8203467130661011
0 references
0.7987926602363586
0 references
0.7672512531280518
0 references
0.7663356065750122
0 references
