Asymptotically optimal approach to the approximate solution of several problems of covering a graph by nonadjacent cycles (Q2396372)

From MaRDI portal
Revision as of 09:34, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Asymptotically optimal approach to the approximate solution of several problems of covering a graph by nonadjacent cycles
scientific article

    Statements

    Asymptotically optimal approach to the approximate solution of several problems of covering a graph by nonadjacent cycles (English)
    0 references
    0 references
    0 references
    8 June 2017
    0 references
    0 references
    cycle cover of a graph
    0 references
    traveling salesman problem
    0 references
    approximation algorithms
    0 references
    computational complexity
    0 references
    approximation accuracy
    0 references
    asymptotic optimality
    0 references
    random instances
    0 references
    probabilistic analysis
    0 references
    0 references