The maximum \(f\)-depth spanning tree problem (Q1603381): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0020-0190(01)00160-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2019955382 / rank | |||
Normal rank | |||
Latest revision as of 09:17, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The maximum \(f\)-depth spanning tree problem |
scientific article |
Statements
The maximum \(f\)-depth spanning tree problem (English)
0 references
14 July 2002
0 references
Approximate algorithms
0 references
Differential ratio
0 references
Performance ratio
0 references
Analysis of algorithms
0 references
Reductions
0 references
0 references
0 references
0 references
