### Abstract

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^{c} D) of the vertices.

Original language | English (US) |
---|---|

Pages (from-to) | 1-11 |

Number of pages | 11 |

Journal | Electronic Journal of Combinatorics |

Volume | 4 |

Issue number | 2 R |

State | Published - 1997 |

### Fingerprint

### ASJC Scopus subject areas

- Discrete Mathematics and Combinatorics

### Cite this

**Real time asymtotic packing.** / Spencer, Joel.

Research output: Contribution to journal › Article

*Electronic Journal of Combinatorics*, vol. 4, no. 2 R, pp. 1-11.

}

TY - JOUR

T1 - Real time asymtotic packing

AU - Spencer, Joel

PY - 1997

Y1 - 1997

N2 - 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 lnc D) of the vertices.

AB - 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 lnc D) of the vertices.

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

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

M3 - Article

AN - SCOPUS:13844251995

VL - 4

SP - 1

EP - 11

JO - Electronic Journal of Combinatorics

JF - Electronic Journal of Combinatorics

SN - 1077-8926

IS - 2 R

ER -