An \(O(\lg \lg {\mathrm {OPT}})\)-approximation algorithm for multi-guarding galleries (Q2340409): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an 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/s00454-014-9656-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W200149117 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learnability and the Vapnik-Chervonenkis dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Algorithms for Fractional Packing and Covering Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some NP-hard polygon decomposition problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient visibility queries in simple polygons / 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: On the set multicover problem in geometric settings / 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: Algorithms for polytope covering and approximation / 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: Inapproximability results for guarding polygons and terrains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hitting sets when the VC-dimension is small / 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: Q4198056 / 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: 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: 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: Terrain Guarding is NP-Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945523 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost tight bounds for \(\epsilon\)-nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of art gallery problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4778540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on the paper ``K-vertex guarding simple polygons'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3799261 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(K\)-vertex guarding simple polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guarding galleries where no point sees a small area. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4886046 / rank
 
Normal rank

Latest revision as of 22:50, 9 July 2024

scientific article
Language Label Description Also known as
English
An \(O(\lg \lg {\mathrm {OPT}})\)-approximation algorithm for multi-guarding galleries
scientific article

    Statements

    An \(O(\lg \lg {\mathrm {OPT}})\)-approximation algorithm for multi-guarding galleries (English)
    0 references
    16 April 2015
    0 references
    art gallery problem
    0 references
    polygon guarding
    0 references
    approximation algorithm
    0 references
    epsilon-net
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers