An Efficient Polynomial Time Approximation Scheme for the Constrained Minimum Spanning Tree Problem Using Matroid Intersection (Q4651462)
From MaRDI portal
scientific article; zbMATH DE number 2135765
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Efficient Polynomial Time Approximation Scheme for the Constrained Minimum Spanning Tree Problem Using Matroid Intersection |
scientific article; zbMATH DE number 2135765 |
Statements
An Efficient Polynomial Time Approximation Scheme for the Constrained Minimum Spanning Tree Problem Using Matroid Intersection (English)
0 references
21 February 2005
0 references
approximation algorithm
0 references
spanning tree
0 references
matroid intersection
0 references
bicriteria optimization
0 references
