Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal (Q5501947): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2004163233 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 00:33, 20 March 2024
scientific article; zbMATH DE number 6472761
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal |
scientific article; zbMATH DE number 6472761 |
Statements
Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal (English)
0 references
14 August 2015
0 references
approximation algorithms
0 references
bounded degree
0 references
iterative rounding
0 references
spanning trees
0 references
