An Improved Strategy for Exploring a Grid Polygon (Q3408174): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Not being (super)thin or solid is hard: A study of grid Hamiltonicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for lawn mowing and milling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph exploration by a finite automaton / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive on-line coverage of grid environments by a mobile robot / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian properties of triangular grid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton Paths in Grid Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3007438 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, <i>k</i>-MST, and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undirected ST-connectivity in log-space / rank
 
Normal rank

Latest revision as of 12:21, 2 July 2024

scientific article
Language Label Description Also known as
English
An Improved Strategy for Exploring a Grid Polygon
scientific article

    Statements

    An Improved Strategy for Exploring a Grid Polygon (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    24 February 2010
    0 references
    0 references
    exploration problem
    0 references
    path planning
    0 references
    mobile robot
    0 references
    grid polygon
    0 references
    competitive ratio
    0 references
    0 references