Parallel local search for Steiner trees in graphs (Q1808193)

From MaRDI portal
Revision as of 20:45, 27 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Parallel local search for Steiner trees in graphs
scientific article

    Statements

    Parallel local search for Steiner trees in graphs (English)
    0 references
    0 references
    0 references
    2 December 1999
    0 references
    Steiner tree problem
    0 references
    traveling salesman problem
    0 references
    parallel local search algorithm
    0 references
    multiple-step parallelism
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references