A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem. (Q1426727)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2057195
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem. |
scientific article; zbMATH DE number 2057195 |
Statements
A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem. (English)
0 references
15 March 2004
0 references
Spanning tree
0 references
Bicriteria approximation
0 references
Fully polynomial approximation scheme
0 references
Matrix-tree theorem
0 references
0.8363597989082336
0 references
0.8271689414978027
0 references
0.792605996131897
0 references
0.7894320487976074
0 references
