Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices (Q408370)
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: Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices |
scientific article; zbMATH DE number 6022214
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices |
scientific article; zbMATH DE number 6022214 |
Statements
Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices (English)
0 references
5 April 2012
0 references
traveling salesman problem
0 references
2-matching
0 references
approximation algorithm
0 references
0 references
0 references
0.8515681624412537
0 references
0.8340537548065186
0 references
0.8301123976707458
0 references
0.8272320628166199
0 references
