Finding 2-factors closer to TSP tours in cubic graphs (Q2848544)
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 6212015
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding 2-factors closer to TSP tours in cubic graphs |
scientific article; zbMATH DE number 6212015 |
Statements
26 September 2013
0 references
bridgeless cubic graphs
0 references
minimum-weight 2-factor covering 3-edge cuts
0 references
polyhedral description of 2-factors covering 3-edge cuts
0 references
2-factor covering 3- and 4-edge cuts
0 references
minimum 2-edge-connected spanning subgraphs
0 references
0 references
0 references
0 references
0.8717158
0 references
0.8717157
0 references
0 references
0.87067676
0 references
0.86586016
0 references
0.8637148
0 references
0.8636353
0 references
Finding 2-factors closer to TSP tours in cubic graphs (English)
0 references
