\((p-1)/(p+1)\)-approximate algorithms for \(p\)-traveling salesmen problems on a tree with minmax objective (Q1363767): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Two exact algorithms for the distance-constrained vehicle routing problem / rank | |||
Normal rank | |||
Revision as of 17:12, 27 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \((p-1)/(p+1)\)-approximate algorithms for \(p\)-traveling salesmen problems on a tree with minmax objective |
scientific article |
Statements
\((p-1)/(p+1)\)-approximate algorithms for \(p\)-traveling salesmen problems on a tree with minmax objective (English)
0 references
11 August 1997
0 references
traveling salesman
0 references
location-allocation problems
0 references
