On the asymptotic optimality of a solution of the Euclidean problem of covering a graph by \(m\) nonadjacent cycles of maximum total weight (Q294361): 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: Approximability of the problem about a minimum-weight cycle cover of a graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimum-weight cycle covers and their approximability / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The traveling salesman problem and its variations / rank | |||
Normal rank | |||
Latest revision as of 04:43, 12 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the asymptotic optimality of a solution of the Euclidean problem of covering a graph by \(m\) nonadjacent cycles of maximum total weight |
scientific article |
Statements
On the asymptotic optimality of a solution of the Euclidean problem of covering a graph by \(m\) nonadjacent cycles of maximum total weight (English)
0 references
16 June 2016
0 references
\(m\) nonadjacent cycles of maximum total weight
0 references
