The non-uniform bounded degree minimum diameter spanning tree problem with an application in P2P networking (Q1941696)
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: The non-uniform bounded degree minimum diameter spanning tree problem with an application in P2P networking |
scientific article; zbMATH DE number 6147764
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The non-uniform bounded degree minimum diameter spanning tree problem with an application in P2P networking |
scientific article; zbMATH DE number 6147764 |
Statements
The non-uniform bounded degree minimum diameter spanning tree problem with an application in P2P networking (English)
0 references
21 March 2013
0 references
approximation algorithms
0 references
graph theory
0 references
degree bounds
0 references
spanning trees
0 references
0.8209942579269409
0 references
0.8209035396575928
0 references