Approximating the tree and tour covers of a graph (Q688437)
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: Approximating the tree and tour covers of a graph |
scientific article; zbMATH DE number 444827
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating the tree and tour covers of a graph |
scientific article; zbMATH DE number 444827 |
Statements
Approximating the tree and tour covers of a graph (English)
0 references
16 January 1994
0 references
approximation algorithms
0 references
weighted vertex cover
0 references
traveling salesman
0 references
Steiner tree
0 references
0.94996893
0 references
0.9324038
0 references
0.92813945
0 references
0.91470766
0 references
0 references
0.90653145
0 references
0.9011139
0 references
0 references
0.89647746
0 references
