Approximation algorithms for some minimum postmen cover problems (Q5918771)

From MaRDI portal
Revision as of 19:28, 29 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7567766
Language Label Description Also known as
English
Approximation algorithms for some minimum postmen cover problems
scientific article; zbMATH DE number 7567766

    Statements

    Approximation algorithms for some minimum postmen cover problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 August 2022
    0 references
    approximation algorithm
    0 references
    traveling salesman problem
    0 references
    rural postman problem
    0 references
    Chinese postman problem
    0 references
    postmen cover
    0 references
    0 references

    Identifiers