Sharp bounds for Karp's “patching”-algorithm for the approximate solution of the traveling salesman problem (Q3730367): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/02331938608843104 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1981747540 / rank | |||
Normal rank | |||
Revision as of 00:08, 20 March 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
