Q5115778 (Q5115778): 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 / arXiv ID
 
Property / arXiv ID: 1710.00386 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4580083 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Constant‐Factor Approximation Algorithm for Optimal 1.5D Terrain Guarding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5115778 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Hardness of Art Gallery Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4580094 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for maximum independent set of pseudo-disks / 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: A Pseudopolynomial Time O(logn)-Approximation Algorithm for Art Gallery Problems / 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: Finding Small Hitting Sets in Infinite Range Spaces of Bounded VC-Dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximations for guarding 1.5-dimensional terrains / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of \(k\)-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 4-Approximation Algorithm for Guarding 1.5-Dimensional Terrains / 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: Terrain Guarding is NP-Hard / 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: Guarding terrains via local search / 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: Planar Formulae and Their Uses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4904144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved results on geometric hitting set problems / rank
 
Normal rank

Latest revision as of 07:33, 23 July 2024

scientific article; zbMATH DE number 7236415
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 7236415

    Statements

    0 references
    0 references
    18 August 2020
    0 references
    terrain guarding
    0 references
    rectilinear terrain
    0 references
    computational complexity
    0 references

    Identifiers