Approximation algorithms for art gallery problems in polygons (Q968202): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 6 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.dam.2009.12.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2153108139 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q56700240 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visibility of disjoint polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time approximation algorithm for the weighted vertex cover problem / 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: Edge guards in rectilinear polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for guard placement in polygons with holes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient visibility queries in simple 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 Greedy Heuristic for the Set-Covering Problem / 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 galleries and terrains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for terrain guarding. / 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: Decomposition of Polygons into Simpler Components: Feature Generation for Syntactic Pattern Recognition / 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visibility Algorithms in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approximation Scheme for Terrain Guarding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized guarding and partitioning for rectilinear polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3050374 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for combinatorial problems / 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: A 4-Approximation Algorithm for Guarding 1.5-Dimensional Terrains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visibility of a simple polygon / 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 ratio of optimal integral and fractional covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / 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: Some NP-hard polygon decomposition problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3795225 / 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: Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:43, 2 July 2024

scientific article
Language Label Description Also known as
English
Approximation algorithms for art gallery problems in polygons
scientific article

    Statements

    Approximation algorithms for art gallery problems in polygons (English)
    0 references
    0 references
    5 May 2010
    0 references
    0 references
    approximation algorithms
    0 references
    computational geometry
    0 references
    art gallery problems
    0 references
    visibility polygons
    0 references
    minimum set cover
    0 references
    greedy algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references