Concepedia

Randomized Covering Algorithms

Randomized Covering Algorithms is a computational method in randomized geometric algorithms that distinguishes itself by probabilistically selecting and combining geometric elements to efficiently construct a cover with guaranteed approximation bounds.

128

Publications

6K

Citations

264

Authors

152

Institutions

Publications per year

2017–2026

8

Parents

Publications

128

Vertex Cover: Further Observations and Further Improvements

Jianer Chen, Iyad Kanj, Weijia Jia · Journal of Algorithms · 2001 · 408 citations

, , +10

Set k-cover algorithms for energy efficient monitoring in wireless sensor networks

Zoë Abrams, Ashish Goel, Serge Plotkin · 2004 · 364 citations

, , +16

A deterministic view of random sampling and its use in geometry

Bernard Chazelle, Joel Friedman · COMBINATORICA · 1990 · 258 citations

, , +17

Improved Bounds for Planar k -Sets and Related Problems

Tuli Dey · Discrete & Computational Geometry · 1998 · 240 citations · Full text

, , +9

Separators for sphere-packings and nearest neighbor graphs

Gary L. Miller, Shang‐Hua Teng, William P. Thurston et al. · Journal of the ACM · 1997 · 223 citations · Full text

, , +13

1–5 of 128

Authors

264

  1. PK
    Pankaj K. Agarwal

    Duke University, United States

    4 publications · 139 citations

    4

    h-index

  2. BA
    Boris Aronov

    New York University, United States

    4 publications · 249 citations

    4

    h-index

  3. NB
    Nikhil Bansal

    IBM (United States), United States

    3 publications · 81 citations

    3

    h-index

  4. BE
    Bertrand Estellon

    Laboratoire d’Informatique Fondamentale de Marseille, France

    2 publications · 38 citations

    2

    h-index

  5. MS
    Micha Sharir

    Tel Aviv University, Israel

    2 publications · 80 citations

    2

    h-index

1–5 of 264

Institutions

152

  1. Hungarian Academy of Sciences

    Budapest, Hungary

    6 h-index

    9 publications

    671 citations

  2. Tel Aviv University

    Tel Aviv, Israel

    6 h-index

    8 publications

    179 citations

  3. University of California, Berkeley

    Berkeley, United States

    5 h-index

    5 publications

    389 citations

  4. Carnegie Mellon University

    Pittsburgh, United States

    5 h-index

    8 publications

    430 citations

  5. Centre National de la Recherche Scientifique

    Paris, France

    5 h-index

    10 publications

    476 citations

  6. Hebrew University of Jerusalem

    Jerusalem, Israel

    4 h-index

    6 publications

    243 citations

  7. Cornell University

    Ithaca, United States

    4 h-index

    5 publications

    310 citations

  8. New York University

    New York, United States

    4 h-index

    4 publications

    249 citations

1–8 of 152

Venues

  1. Theoretical Computer Science

    10 publications · 327 citations

    10

    h-index

  2. Discrete Mathematics

    8 publications · 182 citations

    8

    h-index

  3. Discrete & Computational Geometry

    7 publications · 421 citations

    7

    h-index

  4. Information Processing Letters

    5 publications · 122 citations

    5

    h-index

  5. Designs Codes and Cryptography

    4 publications · 97 citations

    4

    h-index

1–5