Parameterized Analysis of Art Gallery and Terrain Guarding (Q5042224): 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.1007/978-3-030-50026-9_2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3035901889 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visibility graphs of staircase polygons and the weak Bruhat order. I: From visibility graphs to maximal chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Irrational Guards are Sometimes Needed / rank
 
Normal rank
Property / cites work
 
Property / cites work: The art gallery problem is ∃ ℝ-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parameterized Complexity of Guarding Almost Convex Polygons. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameter analysis for guarding terrains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Algorithms for Terrain Guarding / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the combinatorial and algebraic complexity of quantifier elimination / 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: Approximability of guarding weak visibility polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal Terrain Guarding is NP-complete / 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: Almost optimal set covers in finite VC-dimension / 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: Algorithms for polytope covering and approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for minimizing vertex guards on art galleries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / 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: Q4503944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / 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 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: Improved approximations for guarding 1.5-dimensional terrains / rank
 
Normal rank
Property / cites work
 
Property / cites work: On characterizing terrain visibility graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lost Continent of Polynomial Time: Preprocessing and Kernelization / 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: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2970453 / 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: Unsolved problems in visibility graphs of points, segments, and polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guarding terrains via local search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new upper bound for the VC-dimension of visibility regions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guarding galleries where every point sees a large area / 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: A fixed-parameter algorithm for guarding 1.5D terrains / 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: Terrain Guarding is NP-Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast vertex guarding for polygons with and without holes / 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: 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: What’s Next? Future Directions in Parameterized Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reflections on Multivariate Algorithmics and Problem Parameterization / 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
Property / cites work
 
Property / cites work: Q4945523 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guarding galleries where no point sees a small area. / rank
 
Normal rank

Latest revision as of 12:46, 30 July 2024

scientific article; zbMATH DE number 7603910
Language Label Description Also known as
English
Parameterized Analysis of Art Gallery and Terrain Guarding
scientific article; zbMATH DE number 7603910

    Statements

    Parameterized Analysis of Art Gallery and Terrain Guarding (English)
    0 references
    0 references
    0 references
    19 October 2022
    0 references
    parameterized algorithms
    0 references
    parameterized complexity
    0 references
    art gallery
    0 references
    terrain guarding
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers