Sharp bounds for Karp's “patching”-algorithm for the approximate solution of the traveling salesman problem (Q3730367): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:17, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sharp bounds for Karp's “patching”-algorithm for the approximate solution of the traveling salesman problem |
scientific article |
Statements
Sharp bounds for Karp's “patching”-algorithm for the approximate solution of the traveling salesman problem (English)
0 references
1986
0 references
patching
0 references
worst case analysis
0 references
approximate solution
0 references
traveling salesman
0 references
