On finding optimal and near-optimal lineal spanning trees (Q1105381)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4058882
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On finding optimal and near-optimal lineal spanning trees |
scientific article; zbMATH DE number 4058882 |
Statements
On finding optimal and near-optimal lineal spanning trees (English)
0 references
1988
0 references
constraint satisfaction
0 references
depth-first search
0 references
NP-completeness
0 references
lineal spanning trees
0 references
approximation algorithms
0 references
0.91918933
0 references
0.91509825
0 references
0 references
0 references
0.9088417
0 references
0 references
0.9041513
0 references
0.9041513
0 references
0 references
