A \(\frac78\)-approximation algorithm for metric Max TSP (Q1847381): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3840359 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4461914 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Better approximations for max TSP / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Staged Primal-Dual Algorithm for Finding a Minimum Cost Perfect Two-Matching in an Undirected Graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3686457 / rank | |||
Normal rank | |||
Latest revision as of 18:49, 4 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A \(\frac78\)-approximation algorithm for metric Max TSP |
scientific article |
Statements
A \(\frac78\)-approximation algorithm for metric Max TSP (English)
0 references
24 June 2003
0 references
0 references
