An <i>O</i>(log <i>k</i>) approximation algorithm for the <i>k</i> minimum spanning tree problem in the plane (Q2817634): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:15, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An <i>O</i>(log <i>k</i>) approximation algorithm for the <i>k</i> minimum spanning tree problem in the plane |
scientific article |
Statements
An <i>O</i>(log <i>k</i>) approximation algorithm for the <i>k</i> minimum spanning tree problem in the plane (English)
0 references
1 September 2016
0 references
