Approximation algorithms for multi-dimensional assignment problems with decomposable costs (Q1327216)
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: Approximation algorithms for multi-dimensional assignment problems with decomposable costs |
scientific article; zbMATH DE number 590193
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation algorithms for multi-dimensional assignment problems with decomposable costs |
scientific article; zbMATH DE number 590193 |
Statements
Approximation algorithms for multi-dimensional assignment problems with decomposable costs (English)
0 references
15 June 1994
0 references
triangle inequality
0 references
\(k\)-dimensional assignment
0 references
clique
0 references
minimum length of a spanning star
0 references
traveling salesman tour
0 references
heuristics
0 references
worst-case bounds
0 references
0 references
0 references
