Asymptotically optimal approach to the approximate solution of several problems of covering a graph by nonadjacent cycles (Q2396372): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3801366 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A polynomial-time approximation scheme for the Euclidean problem on a cycle cover of a graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximability of the problem about a minimum-weight cycle cover of a graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Random Symmetric Travelling Salesman Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the value of a random minimum spanning tree problem / rank | |||
Normal rank | |||
Revision as of 23:10, 13 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Asymptotically optimal approach to the approximate solution of several problems of covering a graph by nonadjacent cycles |
scientific article |
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
