Approximating bounded-degree spanning trees and connected factors with leaves (Q1728165)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating bounded-degree spanning trees and connected factors with leaves |
scientific article |
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
