Probabilistic analysis of divide‐and‐conquer heuristics for minimum weighted euclidean matching (Q3969884)

From MaRDI portal
Revision as of 01:54, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Probabilistic analysis of divide‐and‐conquer heuristics for minimum weighted euclidean matching
scientific article

    Statements

    Probabilistic analysis of divide‐and‐conquer heuristics for minimum weighted euclidean matching (English)
    0 references
    0 references
    0 references
    0 references
    1983
    0 references
    expected costs of the matchings found by various divide-and-conquer heuristic algorithms
    0 references
    expected times
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references