Concepedia

Randomized Packing Algorithms

Randomized Packing Algorithms is a class of algorithmic methods in computational geometry that employs randomization to efficiently construct or approximate arrangements of geometric objects within a given space, distinguishing itself by leveraging probabilistic strategies to achieve improved performance or simplicity in packing configurations compared to deterministic counterparts.

78

Publications

3.4K

Citations

174

Authors

111

Institutions

Publications per year

2017–2026

8

Parents

Publications

78

A deterministic view of random sampling and its use in geometry

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

, , +17

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

e-approximations with minimum packing constraint violation (extended abstract)

Jyh-Han Lin, Jeffrey Scott Vitter · 1992 · 215 citations · Full text

, , +17

Randomized Rounding without Solving the Linear Program

1995 · 183 citations

, , +15

The minimum degree threshold for perfect graph packings

Daniela Kühn, Deryk Osthus · COMBINATORICA · 2009 · 161 citations

, , +14

1–5 of 78

Authors

174

  1. ZC
    Zhi‐Zhong Chen

    Tokyo Denki University, Japan

    3 publications · 52 citations

    3

    h-index

  2. JC
    Jianer Chen

    Texas A&M University, United States

    3 publications · 118 citations

    3

    h-index

  3. TH
    Thore Husfeldt

    Lund University, Sweden

    2 publications · 120 citations

    2

    h-index

  4. RT
    Ruka Tanahashi

    Tokyo Denki University, Japan

    2 publications · 42 citations

    2

    h-index

  5. LW
    Lusheng Wang

    City University of Hong Kong, Hong Kong SAR China

    2 publications · 36 citations

    2

    h-index

1–5 of 174

Institutions

111

  1. Texas A&M University

    College Station, United States

    3 h-index

    7 publications

    350 citations

  2. University of Waterloo

    Waterloo, Canada

    3 h-index

    5 publications

    125 citations

  3. University of Alberta

    Edmonton, Canada

    3 h-index

    4 publications

    149 citations

  4. Tokyo Denki University

    Tokyo, Japan

    3 h-index

    5 publications

    94 citations

  5. Princeton University

    Princeton, United States

    3 h-index

    6 publications

    734 citations

  6. Cornell University

    Ithaca, United States

    2 h-index

    3 publications

    303 citations

  7. City University of Hong Kong

    Hong Kong, Hong Kong

    2 h-index

    2 publications

    36 citations

  8. Lund University

    Lund, Sweden

    2 h-index

    4 publications

    240 citations

1–8 of 111

Venues

  1. Algorithmica

    7 publications · 282 citations

    7

    h-index

  2. Information Processing Letters

    6 publications · 207 citations

    6

    h-index

  3. Discrete Mathematics

    6 publications · 170 citations

    6

    h-index

  4. Discrete & Computational Geometry

    3 publications · 51 citations

    3

    h-index

  5. Journal of Combinatorial Optimization

    3 publications · 50 citations

    3

    h-index

1–5