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 |
Created claim: Wikidata QID (P12): Q55880291, #quickstatements; #temporary_batch_1706300061798 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q55880291 / rank | |||
Normal rank | |||
Revision as of 21:24, 26 January 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
