Approximation algorithms for the min-max clustered \(k\)-traveling salesmen problems (Q2676463)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Approximation algorithms for the min-max clustered \(k\)-traveling salesmen problems
scientific article

    Statements

    Approximation algorithms for the min-max clustered \(k\)-traveling salesmen problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 September 2022
    0 references
    approximation algorithm
    0 references
    min-max
    0 references
    traveling salesman problem
    0 references
    clustered traveling salesman problem
    0 references
    0 references
    0 references

    Identifiers