On optimal solutions to the problem of gossiping in minimum time (Q2747181)
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: On optimal solutions to the problem of gossiping in minimum time |
scientific article; zbMATH DE number 1657299
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On optimal solutions to the problem of gossiping in minimum time |
scientific article; zbMATH DE number 1657299 |
Statements
19 November 2001
0 references
gossiping
0 references
On optimal solutions to the problem of gossiping in minimum time (English)
0 references
The author considers a variant of the well-known gossip problem where, in addition, each call takes a unit of time. For infinitely many instances \(n\) (number of persons), he determines better solutions than the previously known solutions, and for some \(n\) his solutions are even optimal.
0 references
