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

From MaRDI portal
Revision as of 19:05, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(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

    title
    Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching (English)
    0 references
    author
    Kenneth J. Supowit
    0 references
    Edward M. Reingold
    0 references
    publication date
    1983
    0 references
    zbMATH Keywords
    graph algorithm
    0 references
    computational geometry
    0 references

    Identifiers

    DOI
    10.1137/0212008
    0 references
    zbMATH DE Number
    3789846
    0 references
    OpenAlex ID
    W2055674322
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3967061&oldid=31459779"
    Powered by MediaWiki