Real time asymtotic packing

Joel Spencer

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish (US)
Pages (from-to)1-11
Number of pages11
JournalElectronic Journal of Combinatorics
Issue number2 R
StatePublished - 1997

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics
  • Applied Mathematics


Dive into the research topics of 'Real time asymtotic packing'. Together they form a unique fingerprint.

Cite this