A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem. (Q1426727): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.orl.2003.06.003 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2024840331 / rank | |||
Normal rank | |||
Revision as of 20:05, 19 March 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
