An Efficient Polynomial Time Approximation Scheme for the Constrained Minimum Spanning Tree Problem Using Matroid Intersection (Q4651462): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Latest revision as of 17:46, 5 March 2024
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
