Near-linear approximation algorithms for geometric hitting sets (Q2429345): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Orthogonal range reporting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing Levels in Arrangements and Higher Order Voronoi Diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Many Faces in Arrangements of Lines and Segments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3514515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945502 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Bounds for the Union of Locally Fat Objects in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Approximating the Depth and Related Problems / 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: Polynomial-time approximation schemes for packing and piercing fat objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of random sampling in computational geometry. II / 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: Q5452284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Functional Approach to Data Structures and Its Use in Multidimensional Searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: On arrangements of Jordan arcs with three intersections per pair / 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: Q5365154 / 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: Optimal packing and covering in the plane are NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Selection and Ranking: Sorted Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\epsilon\)-nets and simplex range queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for covering and packing problems in image processing and VLSI / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Set Cover and Hitting Sets for Polytopes in R / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Colored Orthogonal Range Counting / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles / 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: Reporting points in halfspaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic fractional cascading / rank
 
Normal rank
Property / cites work
 
Property / cites work: PTAS for geometric hitting set problems via local search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast stabbing of boxes in high dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Boundary Complexity of the Union of Fat Triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight lower bounds for the size of epsilon-nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: New existence proofs ε-nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4325546 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Epsilon nets and union complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4782696 / rank
 
Normal rank

Latest revision as of 03:38, 5 July 2024

scientific article
Language Label Description Also known as
English
Near-linear approximation algorithms for geometric hitting sets
scientific article

    Statements

    Near-linear approximation algorithms for geometric hitting sets (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    26 April 2012
    0 references
    0 references
    geometric range spaces
    0 references
    hitting sets
    0 references
    cuttings
    0 references
    approximation algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references