\((p-1)/(p+1)\)-approximate algorithms for \(p\)-traveling salesmen problems on a tree with minmax objective (Q1363767)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: (p-1)/(p+1)-approximate algorithms for p-traveling salesmen problems on a tree with minmax objective |
scientific article; zbMATH DE number 1047186
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \((p-1)/(p+1)\)-approximate algorithms for \(p\)-traveling salesmen problems on a tree with minmax objective |
scientific article; zbMATH DE number 1047186 |
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
0.9163890480995178
0 references
0.8779691457748413
0 references
0.8621194362640381
0 references
0.8522425889968872
0 references
