Guarding orthogonal art galleries with sliding \(k\)-transmitters: hardness and approximation (Q1755780): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Modem illumination of monotone polygons / 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: On Guarding Orthogonal Polygons with Sliding Cameras / rank
 
Normal rank
Property / cites work
 
Property / cites work: On triangulating planar graphs under the four-connectivity constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4636499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guarding orthogonal art galleries with sliding \(k\)-transmitters: hardness and approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost optimal set covers in finite VC-dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorics and complexity of guarding polygons with edge and point 2-transmitters / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial theorem in plane geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for geometric set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guarding monotone art galleries with sliding cameras in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 3-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guarding orthogonal art galleries with sliding cameras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guarding Orthogonal Art Galleries Using Sliding Cameras: Algorithmic and Hardness Results / 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: The Rectilinear Steiner Tree Problem is $NP$-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Traditional Galleries Require Fewer Watchmen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal segment stabbing / rank
 
Normal rank
Property / cites work
 
Property / cites work: GUARDING ORTHOGONAL ART GALLERIES WITH SLIDING CAMERAS / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(\lg \lg {\mathrm {OPT}})\)-approximation algorithm for multi-guarding galleries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate guarding of monotone and rectilinear polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of art gallery problems / 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: Galleries need fewer mobile guards: A variation on Chvatal's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3799261 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two NP‐Hard Art‐Gallery Problems for Ortho‐Polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to visibility representations of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guarding Thin Orthogonal Polygons Is Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945523 / rank
 
Normal rank

Latest revision as of 19:47, 17 July 2024

scientific article
Language Label Description Also known as
English
Guarding orthogonal art galleries with sliding \(k\)-transmitters: hardness and approximation
scientific article

    Statements

    Guarding orthogonal art galleries with sliding \(k\)-transmitters: hardness and approximation (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    11 January 2019
    0 references
    art gallery problem
    0 references
    sliding \(k\)-transmitters
    0 references
    \(\epsilon \)-nets
    0 references
    0 references
    0 references
    0 references

    Identifiers