Is It FPT to Cover Points with Tours on Minimum Number of Bends (Errata)? (Q2950590): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1209144
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1142/s0218195915500028 / rank
Normal rank
 
Property / author
 
Property / author: Vladimir Estivill-Castro / rank
 
Normal rank
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.1142/s0218195915500028 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2260708800 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-link watchman tours / rank
 
Normal rank
Property / cites work
 
Property / cites work: SHORTEST PATH QUERIES IN RECTILINEAR WORLDS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rectilinear paths among rectilinear obstacles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Covering Tours with Turn Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Traversing a set of points with a minimum number of turns / 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: FPT-ALGORITHMS FOR MINIMUM-BENDS TOURS / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1142/S0218195915500028 / rank
 
Normal rank

Latest revision as of 05:52, 20 December 2024

scientific article
Language Label Description Also known as
English
Is It FPT to Cover Points with Tours on Minimum Number of Bends (Errata)?
scientific article

    Statements

    Is It FPT to Cover Points with Tours on Minimum Number of Bends (Errata)? (English)
    0 references
    9 October 2015
    0 references
    computational geometry
    0 references
    fixed-parameter tractable
    0 references
    minimum-bends tours
    0 references
    covering with hyperplanes
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references