On spanning 2-trees in a graph (Q1356500)
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 1018580
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On spanning 2-trees in a graph |
scientific article; zbMATH DE number 1018580 |
Statements
On spanning 2-trees in a graph (English)
0 references
16 March 1998
0 references
The paper presents an approximation algorithm for finding a minimum-weight spanning 2-tree in a weighted complete graph. The asymptotic performance ratio is less than or equal to 2 when the edge weights satisfy the triangle equality, and at most \((3+ 4\sqrt 3)/6\approx 1.655\) when the graph is a complete Euclidean graph on a set of points in the plane.
0 references
spanning trees
0 references
approximation algorithm
0 references
0 references
0.8251420259475708
0 references
0.8050453066825867
0 references
0.8041120767593384
0 references
0.7991677522659302
0 references
