Traversing a set of points with a minimum number of turns (Q5901749): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00454-008-9127-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1982128583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-link watchman tours / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Covering Tours with Turn Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Research Problems in Discrete Geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: COVERING A SET OF POINTS WITH A MINIMUM NUMBER OF TURNS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved lower bounds for the link length of rectilinear spanning paths in grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Angle-restricted tours in the plane. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for hitting objects with straight lines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4326201 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945513 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of locating linear facilities in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4537759 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:44, 1 July 2024

scientific article; zbMATH DE number 5551251
Language Label Description Also known as
English
Traversing a set of points with a minimum number of turns
scientific article; zbMATH DE number 5551251

    Statements

    Traversing a set of points with a minimum number of turns (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    6 May 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    computational geometry
    0 references
    minimum link spanning path
    0 references
    approximation algorithms
    0 references
    0 references