A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids (Q1035684)
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 push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids |
scientific article; zbMATH DE number 5624933
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids |
scientific article; zbMATH DE number 5624933 |
Statements
A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids (English)
0 references
4 November 2009
0 references
approximation algorithms
0 references
push-relabel
0 references
degree-bounded network design
0 references
spanning trees
0 references
0 references
0.919991672039032
0 references
0.8545204401016235
0 references
0.8308545351028442
0 references
0.8218467831611633
0 references
