A Constant-Factor Approximation Algorithm for the Geometric<i>k</i>-MST Problem in the Plane (Q4229405): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:09, 6 February 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
