Real time asymtotic packing

Research output: Contribution to journalArticle

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

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

Fingerprint

Greedy Algorithm
Hypergraph
Packing
Disjoint
Differential equation
Differential equations
Context

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics

Cite this

Real time asymtotic packing. / Spencer, Joel.

In: Electronic Journal of Combinatorics, Vol. 4, No. 2 R, 1997, p. 1-11.

Research output: Contribution to journalArticle

@article{891d619f03f740449e8b08b83da98217,
title = "Real time asymtotic packing",
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 lnc D) of the vertices.",
author = "Joel Spencer",
year = "1997",
language = "English (US)",
volume = "4",
pages = "1--11",
journal = "Electronic Journal of Combinatorics",
issn = "1077-8926",
publisher = "Electronic Journal of Combinatorics",
number = "2 R",

}

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 -