Optimum watchman routes (Q1107312): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Wei-Pang Chin / rank
 
Normal rank
Property / author
 
Property / author: Simeon C. Ntafos / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3799834 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest watchman routes in simple polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulating Simple Polygons and Equivalent Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path Planning in 0/1/∞ Weighted Regions with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3799261 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Euclidean traveling salesman problem is NP-complete / rank
 
Normal rank

Latest revision as of 17:35, 18 June 2024

scientific article
Language Label Description Also known as
English
Optimum watchman routes
scientific article

    Statements

    Optimum watchman routes (English)
    0 references
    1988
    0 references
    visibility
    0 references
    computational geometry
    0 references
    watchman problem
    0 references
    NP-hard
    0 references
    0 references
    0 references

    Identifiers