Approximation Algorithms for Some Postman Problems (Q4191881)

From MaRDI portal
Revision as of 20:25, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 3630508
Language Label Description Also known as
English
Approximation Algorithms for Some Postman Problems
scientific article; zbMATH DE number 3630508

    Statements

    Approximation Algorithms for Some Postman Problems (English)
    0 references
    1979
    0 references
    Traveling Salesman Problem
    0 references
    Worst-Case Behavior
    0 references
    Estimation of Execution Time
    0 references
    Np-Complete Problem
    0 references
    Postman Problem
    0 references
    Heuristic Algorithm
    0 references
    Chinese Postman Problem
    0 references
    Rural Postman Problem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references