The zookeeper route problem (Q1193837): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Optimum watchman routes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest watchman routes in simple polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: The robber route problem / 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
Property / cites work
 
Property / cites work: An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon / rank
 
Normal rank

Latest revision as of 14:24, 16 May 2024

scientific article
Language Label Description Also known as
English
The zookeeper route problem
scientific article

    Statements

    The zookeeper route problem (English)
    0 references
    0 references
    0 references
    27 September 1992
    0 references
    0 references
    path planning
    0 references
    zookeeper route problem
    0 references
    NP-hard
    0 references
    polygons
    0 references