Single Commodity-Flow Algorithms for Lifts of Graphic and Co-graphic Matroids (Q4910816)
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 6146547
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Single Commodity-Flow Algorithms for Lifts of Graphic and Co-graphic Matroids |
scientific article; zbMATH DE number 6146547 |
Statements
Single Commodity-Flow Algorithms for Lifts of Graphic and Co-graphic Matroids (English)
0 references
19 March 2013
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.9969156
0 references
0.8612633
0 references
0.8588927
0 references
0.8502659
0 references
0.84772164
0 references
0.8463445
0 references
0.8459971
0 references
0.84350634
0 references
0.84279364
0 references
