Real time asymptotic packing (Q1378545)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Real time asymptotic packing |
scientific article; zbMATH DE number 1118075
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Real time asymptotic packing |
scientific article; zbMATH DE number 1118075 |
Statements
Real time asymptotic packing (English)
0 references
15 February 1998
0 references
Summary: 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.
0 references
random greedy algorithm
0 references
differential equation
0 references
hypergraph
0 references
packing
0 references
0.85366565
0 references
0.84530187
0 references
0.8385156
0 references
0 references
0.8363793
0 references
0.83579665
0 references
