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
Created a new Item |
Set profile property. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q55880291 / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 16:05, 5 March 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
