Small-size ε-nets for axis-parallel rectangles and boxes

Boris Aronov, Esther Ezra, Micha Sharir

    Research output: Contribution to journalArticle

    Abstract

    We show the existence of ε-nets of size O (1/ε log log 1/ε) for planar point sets and axis-parallel rectangular ranges. The same bound holds for points in the plane and "fat" triangular ranges and for point sets in R3 and axis-parallel boxes; these are the first known nontrivial bounds for these range spaces. Our technique also yields improved bounds on the size of ε-nets in the more general context considered by Clarkson and Varadarajan. For example, we show the existence of ε-nets of size O (1/ε log log log 1/ε) for the dual range space of "fat" regions and planar point sets (where the regions are the ground objects and the ranges are subsets stabbed by points). Plugging our bounds into the technique of Brönnimann and Goodrich or of Even, Rawitz, and Shahar, we obtain improved approximation factors (computable in expected polynomial time by a randomized algorithm) for the HITTING SET or the SET COVER problems associated with the corresponding range spaces.

    Original languageEnglish (US)
    Pages (from-to)3248-3282
    Number of pages35
    JournalSIAM Journal on Computing
    Volume39
    Issue number7
    DOIs
    StatePublished - 2010

    Fingerprint

    Oils and fats
    Rectangle
    Point Sets
    Range of data
    Polynomials
    Randomized Algorithms
    Triangular
    Polynomial time
    Subset
    Approximation

    Keywords

    • ε-nets
    • Exponential decay lemma
    • Geometric range spaces
    • HITTING SET
    • SET COVER

    ASJC Scopus subject areas

    • Mathematics(all)
    • Computer Science(all)

    Cite this

    Small-size ε-nets for axis-parallel rectangles and boxes. / Aronov, Boris; Ezra, Esther; Sharir, Micha.

    In: SIAM Journal on Computing, Vol. 39, No. 7, 2010, p. 3248-3282.

    Research output: Contribution to journalArticle

    Aronov, Boris ; Ezra, Esther ; Sharir, Micha. / Small-size ε-nets for axis-parallel rectangles and boxes. In: SIAM Journal on Computing. 2010 ; Vol. 39, No. 7. pp. 3248-3282.
    @article{2a4d3c0c659a4a0c88a106445c8599cb,
    title = "Small-size ε-nets for axis-parallel rectangles and boxes",
    abstract = "We show the existence of ε-nets of size O (1/ε log log 1/ε) for planar point sets and axis-parallel rectangular ranges. The same bound holds for points in the plane and {"}fat{"} triangular ranges and for point sets in R3 and axis-parallel boxes; these are the first known nontrivial bounds for these range spaces. Our technique also yields improved bounds on the size of ε-nets in the more general context considered by Clarkson and Varadarajan. For example, we show the existence of ε-nets of size O (1/ε log log log 1/ε) for the dual range space of {"}fat{"} regions and planar point sets (where the regions are the ground objects and the ranges are subsets stabbed by points). Plugging our bounds into the technique of Br{\"o}nnimann and Goodrich or of Even, Rawitz, and Shahar, we obtain improved approximation factors (computable in expected polynomial time by a randomized algorithm) for the HITTING SET or the SET COVER problems associated with the corresponding range spaces.",
    keywords = "ε-nets, Exponential decay lemma, Geometric range spaces, HITTING SET, SET COVER",
    author = "Boris Aronov and Esther Ezra and Micha Sharir",
    year = "2010",
    doi = "10.1137/090762968",
    language = "English (US)",
    volume = "39",
    pages = "3248--3282",
    journal = "SIAM Journal on Computing",
    issn = "0097-5397",
    publisher = "Society for Industrial and Applied Mathematics Publications",
    number = "7",

    }

    TY - JOUR

    T1 - Small-size ε-nets for axis-parallel rectangles and boxes

    AU - Aronov, Boris

    AU - Ezra, Esther

    AU - Sharir, Micha

    PY - 2010

    Y1 - 2010

    N2 - We show the existence of ε-nets of size O (1/ε log log 1/ε) for planar point sets and axis-parallel rectangular ranges. The same bound holds for points in the plane and "fat" triangular ranges and for point sets in R3 and axis-parallel boxes; these are the first known nontrivial bounds for these range spaces. Our technique also yields improved bounds on the size of ε-nets in the more general context considered by Clarkson and Varadarajan. For example, we show the existence of ε-nets of size O (1/ε log log log 1/ε) for the dual range space of "fat" regions and planar point sets (where the regions are the ground objects and the ranges are subsets stabbed by points). Plugging our bounds into the technique of Brönnimann and Goodrich or of Even, Rawitz, and Shahar, we obtain improved approximation factors (computable in expected polynomial time by a randomized algorithm) for the HITTING SET or the SET COVER problems associated with the corresponding range spaces.

    AB - We show the existence of ε-nets of size O (1/ε log log 1/ε) for planar point sets and axis-parallel rectangular ranges. The same bound holds for points in the plane and "fat" triangular ranges and for point sets in R3 and axis-parallel boxes; these are the first known nontrivial bounds for these range spaces. Our technique also yields improved bounds on the size of ε-nets in the more general context considered by Clarkson and Varadarajan. For example, we show the existence of ε-nets of size O (1/ε log log log 1/ε) for the dual range space of "fat" regions and planar point sets (where the regions are the ground objects and the ranges are subsets stabbed by points). Plugging our bounds into the technique of Brönnimann and Goodrich or of Even, Rawitz, and Shahar, we obtain improved approximation factors (computable in expected polynomial time by a randomized algorithm) for the HITTING SET or the SET COVER problems associated with the corresponding range spaces.

    KW - ε-nets

    KW - Exponential decay lemma

    KW - Geometric range spaces

    KW - HITTING SET

    KW - SET COVER

    UR - http://www.scopus.com/inward/record.url?scp=77956025031&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=77956025031&partnerID=8YFLogxK

    U2 - 10.1137/090762968

    DO - 10.1137/090762968

    M3 - Article

    VL - 39

    SP - 3248

    EP - 3282

    JO - SIAM Journal on Computing

    JF - SIAM Journal on Computing

    SN - 0097-5397

    IS - 7

    ER -