Matrix games in the multicast networks: maximum information flows with network switching. (Q3547247)
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 5454660
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Matrix games in the multicast networks: maximum information flows with network switching. |
scientific article; zbMATH DE number 5454660 |
Statements
21 December 2008
0 references
achievable information rate regions
0 references
matrix games
0 references
max-flow min-cut theorems
0 references
maximum information flows
0 references
multicast routes
0 references
multisource multicast networks
0 references
network coding
0 references
network switching, route packings
0 references
set-covering problems
0 references
switching gaps
0 references
0.8459183573722839
0 references
0.8035047054290771
0 references
0.7775430679321289
0 references
0.7749873995780945
0 references
