Approximating bounded-degree spanning trees and connected factors with leaves (Q1728165)
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: Approximating bounded-degree spanning trees and connected factors with leaves |
scientific article; zbMATH DE number 7027500
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating bounded-degree spanning trees and connected factors with leaves |
scientific article; zbMATH DE number 7027500 |
Statements
Approximating bounded-degree spanning trees and connected factors with leaves (English)
0 references
22 February 2019
0 references
approximation algorithms
0 references
bounded-degree spanning trees
0 references
connected graph factors
0 references
network design
0 references
0.8354817032814026
0 references
0.8317393660545349
0 references
0.8221759796142578
0 references
