Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching (Q3967061)

From MaRDI portal
Revision as of 05:38, 21 October 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
Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching
scientific article

    Statements

    Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching (English)
    0 references
    0 references
    0 references
    1983
    0 references
    graph algorithm
    0 references
    computational geometry
    0 references

    Identifiers