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

From MaRDI portal
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
    0 references
    1983
    0 references
    0 references
    graph algorithm
    0 references
    computational geometry
    0 references
    0 references