A Constant-Factor Approximation Algorithm for the Geometric<i>k</i>-MST Problem in the Plane (Q4229405): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/s0097539796303299 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2017698201 / rank | |||
Normal rank | |||
Latest revision as of 10:13, 30 July 2024
scientific article; zbMATH DE number 1252568
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Constant-Factor Approximation Algorithm for the Geometric<i>k</i>-MST Problem in the Plane |
scientific article; zbMATH DE number 1252568 |
Statements
A Constant-Factor Approximation Algorithm for the Geometric<i>k</i>-MST Problem in the Plane (English)
0 references
22 February 1999
0 references
minimum spanning trees
0 references
\(k\)-MST
0 references
guillotine subdivisions
0 references
quota traveling salesman problem
0 references
prize-collecting salesman problem
0 references
bank robber (orienteering) problem
0 references
network optimization
0 references
computational geometry
0 references
dynamic programming
0 references
approximation algorithms polynomial
0 references
guillotine
0 references
