Approximation algorithms for multi-dimensional assignment problems with decomposable costs (Q1327216)

From MaRDI portal
Revision as of 20:51, 18 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Approximation algorithms for multi-dimensional assignment problems with decomposable costs
scientific article

    Statements

    Approximation algorithms for multi-dimensional assignment problems with decomposable costs (English)
    0 references
    0 references
    0 references
    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

    Identifiers