Approximability of guarding weak visibility polygons (Q2357167): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q2754182 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex Guarding in Weak Visibility Polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: OPTIMUM GUARD COVERS AND m-WATCHMEN ROUTES FOR RESTRICTED POLYGONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial theorem in plane geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Pseudopolynomial Time O(logn)-Approximation Algorithm for Art Gallery Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analytical approach to parallel repetition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guarding galleries and terrains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inapproximability results for guarding polygons and terrains / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold of ln <i>n</i> for approximating set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof of Chvatal's Watchman Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visibility Algorithms in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for art gallery problems in polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Art Gallery Problems in Polygons and Terrains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing and recognizing weak visibility polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Traditional Galleries Require Fewer Watchmen / rank
 
Normal rank
Property / cites work
 
Property / cites work: On guarding the vertices of rectilinear domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation for guarding simple galleries from the perimeter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of art gallery problems / 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: An alternative proof of the rectilinear art gallery theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3799261 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some NP-hard polygon decomposition problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two NP‐Hard Art‐Gallery Problems for Ortho‐Polygons / rank
 
Normal rank

Revision as of 23:39, 13 July 2024

scientific article
Language Label Description Also known as
English
Approximability of guarding weak visibility polygons
scientific article

    Statements

    Approximability of guarding weak visibility polygons (English)
    0 references
    0 references
    0 references
    0 references
    19 June 2017
    0 references
    art gallery problem
    0 references
    visibility
    0 references
    vertex guarding
    0 references
    constant factor approximation algorithm
    0 references
    inapproximability
    0 references
    Euclidean shortest path tree
    0 references
    0 references
    0 references
    0 references

    Identifiers

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