Fast computation of shortest watchman routes in simple polygons (Q1607078)

From MaRDI portal
Revision as of 21:22, 20 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q751323)
scientific article
Language Label Description Also known as
English
Fast computation of shortest watchman routes in simple polygons
scientific article

    Statements

    title
    Fast computation of shortest watchman routes in simple polygons (English)
    0 references
    publication date
    25 July 2002
    0 references
    zbMATH Keywords
    watchman route problem
    0 references

    Identifiers

    zbMATH DE Number
    1771784
    0 references
    Wikidata QID
    Q29304368
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1607078&oldid=22011946"
    Powered by MediaWiki