Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, <i>k</i>-MST, and Related Problems (Q4268710): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: DBLP publication ID (P1635): journals/siamcomp/Mitchell99, #quickstatements; #temporary_batch_1731468600454 |
||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/siamcomp/Mitchell99 / rank | |||
Normal rank | |||
Latest revision as of 05:14, 13 November 2024
scientific article; zbMATH DE number 1354370
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, <i>k</i>-MST, and Related Problems |
scientific article; zbMATH DE number 1354370 |
Statements
Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, <i>k</i>-MST, and Related Problems (English)
0 references
28 October 1999
0 references
approximation algorithms
0 references
polynomial-time approximation scheme
0 references
traveling salesperson problem
0 references
\(k\)-MST
0 references
Steiner minimal trees
0 references
guillotine subdivisions
0 references
computational geometry
0 references
