Geodesic
Real time asymptotic packing
The electronic journal of combinatorics, The Wilf Festschrift volume, Tome 4 (1997) no. 2
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

A random greedy algorithm, somewhat modified, is analyzed by using a real time context and showing that the variables remain close to the solution of a natural differential equation. Given a $(k+1)$-uniform simple hypergraph on $N$ vertices, regular of degree $D$, the algorithm gives a packing of disjoint hyperedges containing all but $O(ND^{-1/k}\ln^cD)$ of the vertices.
DOI : 10.37236/1334
Classification : 05B40, 60D05, 05C65
Mots-clés : random greedy algorithm, differential equation, hypergraph, packing 
@article{10_37236_1334,
     author = {Joel Spencer},
     title = {Real time asymptotic packing},
     journal = {The electronic journal of combinatorics},
     year = {1997},
     volume = {4},
     number = {2},
     doi = {10.37236/1334},
     zbl = {0884.05031},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1334/}
}
TY  - JOUR
AU  - Joel Spencer
TI  - Real time asymptotic packing
JO  - The electronic journal of combinatorics
PY  - 1997
VL  - 4
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1334/
DO  - 10.37236/1334
ID  - 10_37236_1334
ER  - 
%0 Journal Article
%A Joel Spencer
%T Real time asymptotic packing
%J The electronic journal of combinatorics
%D 1997
%V 4
%N 2
%U http://geodesic.mathdoc.fr/articles/10.37236/1334/
%R 10.37236/1334
%F 10_37236_1334
Joel Spencer. Real time asymptotic packing. The electronic journal of combinatorics, The Wilf Festschrift volume, Tome 4 (1997) no. 2. doi: 10.37236/1334

Cité par Sources :