New approximation algorithms for the minimum cycle cover problem (Q5919633)

From MaRDI portal
Revision as of 22:59, 25 July 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q127826236, #quickstatements; #temporary_batch_1721943449312)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7114328
Language Label Description Also known as
English
New approximation algorithms for the minimum cycle cover problem
scientific article; zbMATH DE number 7114328

    Statements

    New approximation algorithms for the minimum cycle cover problem (English)
    0 references
    0 references
    0 references
    0 references
    7 October 2019
    0 references
    vehicle routing
    0 references
    cycle cover
    0 references
    traveling salesman problem
    0 references
    approximation algorithm
    0 references

    Identifiers

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