No label defined (Q4938890)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1405894
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1405894 |
Statements
28 August 2000
0 references
randomized algorithms
0 references
approximation
0 references
greedy algorithms
0 references
random graph process
0 references
0.8144263029098511
0 references
0.8134607672691345
0 references
0.7905256748199463
0 references
The paper is essentially a survey of methods that are based on establishing a connction between a random graph process and an associated differential equation (of a system of equations). The solution to the equation provides a deterministic approximation to the random process. The applicability of this idea is shown on various examples, that include the \(k\)-core of a random graph, greedy algorithm for independent sets, packing in hypergraphs, and others. The paper is a good introduction to the methods that are united into a unified approach. For the entire collection see [Zbl 0920.00042].
0 references
