Watchman routes for lines and line segments (Q2445196): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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.1016/j.comgeo.2013.11.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2067096513 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coverage with k-Transmitters in the Presence of Obstacles / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner problem with edge lengths 1 and 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guarding a set of line segments in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing a shortest watchman path in a simple polygon in polynomial-time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the shortest watchman route in a simple polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum watchman routes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial theorem in plane geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Touring a sequence of polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Watchman tours for polygons with holes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight bound on approximating arbitrary metrics by tree metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4155835 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering grids and orthogonal polygons with periscope guards / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Steiner’s Problem with Rectilinear Distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5578578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesmanpProblem for lines in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cooperative mobile guards in grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Watchman Routes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On gallery watchmen in grids / 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: Q4694752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5613007 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast computation of shortest watchman routes in simple polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time 2-approximation algorithm for the watchman route problem for simple polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: CORRIGENDUM TO "AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES" / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization of the Maximum Distance between the Two Guards Patrolling a Polygonal Region / rank
 
Normal rank
Property / cites work
 
Property / cites work: Illumination in the presence of opaque line segments in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Illuminating disjoint line segments in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945523 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of minimum corridor guarding problems / rank
 
Normal rank

Latest revision as of 10:01, 8 July 2024

scientific article
Language Label Description Also known as
English
Watchman routes for lines and line segments
scientific article

    Statements

    Watchman routes for lines and line segments (English)
    0 references
    0 references
    0 references
    0 references
    14 April 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    watchman route
    0 references
    dynamic programming
    0 references
    NP-hardness
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references