Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices (Q408370): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:36, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices |
scientific article |
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
