On the relationship between the biconnectivity augmentation and traveling salesman problems (Q1165162): 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.1016/0304-3975(82)90059-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2038858023 / rank | |||
Normal rank | |||
Revision as of 19:06, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the relationship between the biconnectivity augmentation and traveling salesman problems |
scientific article |
Statements
On the relationship between the biconnectivity augmentation and traveling salesman problems (English)
0 references
1982
0 references
traveling salesman
0 references
biconnected subgraph
0 references
weighted graph
0 references
approximation algorithm
0 references
biconnectivity augmentation
0 references
graph augmentation
0 references
worst-case analysis
0 references
