Near-linear time approximation schemes for geometric maximum coverage (Q1748995): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2017.11.026 / rank
Normal rank
 
Property / arXiv ID
 
Property / arXiv ID: 1702.01836 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4255028 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of approximations for maximizing submodular set functions—I / 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: Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Some Common Geometric Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering many or few points with unit disks / 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: Translating a convex polygon to contain a maximum number of points. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal placement of convex polygons to maximize point containment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note—On a Modified One-Center Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a circle placement problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411344 / 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: Covering point sets with two disjoint disks or squares / 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: Improved approximation algorithms for geometric set cover / 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: PTAS for geometric hitting set problems via local search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted geometric set cover via quasi-uniform sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743501 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A PTAS for the Weighted Unit Disk Cover Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Reliable Randomized Algorithm for the Closest-Pair Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necklaces, Convolutions, and X + Y / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster all-pairs shortest paths via circuit complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for determining the convex hull of a finite planar set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and approximation algorithms for clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of convex bodies by rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximations and optimal geometric divide-and-conquer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3010463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4344150 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2017.11.026 / rank
 
Normal rank

Latest revision as of 09:05, 11 December 2024

scientific article
Language Label Description Also known as
English
Near-linear time approximation schemes for geometric maximum coverage
scientific article

    Statements

    Near-linear time approximation schemes for geometric maximum coverage (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    15 May 2018
    0 references
    maximum coverage
    0 references
    geometric set cover
    0 references
    polynomial-time approximation scheme
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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