An O\((\log k)\)-approximation algorithm for the \(k\) minimum spanning tree problem in the plane (Q679454): 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.1007/bf02523691 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1537901463 / rank | |||
Normal rank | |||
Latest revision as of 09:39, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An O\((\log k)\)-approximation algorithm for the \(k\) minimum spanning tree problem in the plane |
scientific article |
Statements
An O\((\log k)\)-approximation algorithm for the \(k\) minimum spanning tree problem in the plane (English)
0 references
29 May 1997
0 references
grids
0 references
traveling salesman problem
0 references
minimum tree
0 references
