A polynomial time approximation scheme for minimum cost delay-constrained multicast tree under a Steiner topology (Q1763147)
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: A polynomial time approximation scheme for minimum cost delay-constrained multicast tree under a Steiner topology |
scientific article; zbMATH DE number 2135857
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial time approximation scheme for minimum cost delay-constrained multicast tree under a Steiner topology |
scientific article; zbMATH DE number 2135857 |
Statements
A polynomial time approximation scheme for minimum cost delay-constrained multicast tree under a Steiner topology (English)
0 references
21 February 2005
0 references
Computer communications
0 references
Minimum cost delay-constrained network under a Steiner topology
0 references
Fully polynomial time approximation scheme
0 references
Quality of service
0 references
0.9172809720039368
0 references
0.825252115726471
0 references
0.807319700717926
0 references
0.8011018633842468
0 references
