A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem. (Q1426727): Difference between revisions
From MaRDI portal
Latest revision as of 16:00, 6 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem. |
scientific article |
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