Asymptotically optimal approach to the approximate solution of several problems of covering a graph by nonadjacent cycles (Q2396372)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6727005
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Asymptotically optimal approach to the approximate solution of several problems of covering a graph by nonadjacent cycles |
scientific article; zbMATH DE number 6727005 |
Statements
Asymptotically optimal approach to the approximate solution of several problems of covering a graph by nonadjacent cycles (English)
0 references
8 June 2017
0 references
cycle cover of a graph
0 references
traveling salesman problem
0 references
approximation algorithms
0 references
computational complexity
0 references
approximation accuracy
0 references
asymptotic optimality
0 references
random instances
0 references
probabilistic analysis
0 references
0 references
0.904779016971588
0 references
0.8227183222770691
0 references
0.8218072056770325
0 references
0.8039323687553406
0 references
0.8013964891433716
0 references
