Polynomial-time approximability of the asymmetric problem of covering a graph by a bounded number of cycles (Q6194910)
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: Polynomial-time approximability of the asymmetric problem of covering a graph by a bounded number of cycles |
scientific article; zbMATH DE number 7805771
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial-time approximability of the asymmetric problem of covering a graph by a bounded number of cycles |
scientific article; zbMATH DE number 7805771 |
Statements
Polynomial-time approximability of the asymmetric problem of covering a graph by a bounded number of cycles (English)
0 references
16 February 2024
0 references
cycle cover of graph
0 references
asymmetric traveling salesman problem
0 references
constant-factor approximation algorithm
0 references
0 references
0 references
0 references
0 references
0 references
