\((p-1)/(p+1)\)-approximate algorithms for \(p\)-traveling salesmen problems on a tree with minmax objective (Q1363767): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2008992746 / rank | |||
Normal rank | |||
Latest revision as of 11:01, 30 July 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
