Better approximations for max TSP (Q1607064): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56067402, #quickstatements; #temporary_batch_1710346988437 |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3840359 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximating Capacitated Routing and Delivery Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An approximation algorithm for the maximum traveling salesman problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3686457 / rank | |||
Normal rank | |||
Latest revision as of 11:05, 4 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Better approximations for max TSP |
scientific article |
Statements
Better approximations for max TSP (English)
0 references
25 July 2002
0 references
