Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces (Q3451756): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A QPTAS for Maximum Weight Independent Set of Polygons with Polylogarithmically Many Vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3514515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-Linear Algorithms for Geometric Hitting Sets and Set Covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learnability and the Vapnik-Chervonenkis dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms and APX-hardness results for geometric packing and covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743501 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating hitting sets of axis-parallel rectangles intersecting a monotone curve / 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: Q3579437 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-Polynomial Time Approximation Scheme for Sparse Subsets of Polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: WEIGHTED GEOMETRIC SET COVER PROBLEMS REVISITED / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\epsilon\)-nets and simplex range queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221406 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost tight bounds for \(\epsilon\)-nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4530626 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding small simple cycle separators for 2-connected planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved results on geometric hitting set problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5302610 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-approximability results for optimization problems on bounded degree instances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted geometric set cover via quasi-uniform sampling / rank
 
Normal rank

Latest revision as of 01:58, 11 July 2024

scientific article
Language Label Description Also known as
English
Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces
scientific article

    Statements

    Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces (English)
    0 references
    0 references
    0 references
    0 references
    18 November 2015
    0 references
    set cover
    0 references
    approximation algorithms
    0 references
    polynomial time approximation schemes
    0 references
    pseudodisks
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references