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
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/195058.195218 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2032389500 / rank | |||
Normal rank | |||
Latest revision as of 03:04, 20 March 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
