Single commodity-flow algorithms for lifts of graphic and cographic matroids (Q2820860)
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 6626181
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Single commodity-flow algorithms for lifts of graphic and cographic matroids |
scientific article; zbMATH DE number 6626181 |
Statements
9 September 2016
0 references
set covering polyhedra
0 references
Lehman's theorem
0 references
multi-commodity flows
0 references
even cut matroid
0 references
even cycle matroid
0 references
weakly bipartite graphs
0 references
ellipsoid method
0 references
max cut
0 references
0 references
Single commodity-flow algorithms for lifts of graphic and cographic matroids (English)
0 references
0.9844739437103271
0 references
0.8131261467933655
0 references
0.771288275718689
0 references
0.7595864534378052
0 references
