APPROXIMATION ALGORITHMS FOR THE EUCLIDEAN TRAVELING SALESMAN PROBLEM WITH DISCRETE AND CONTINUOUS NEIGHBORHOODS (Q3636315): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Approximation algorithms for the Geometric Covering Salesman Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: TSP with neighborhoods of varying size / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximation algorithms for TSP with neighborhoods in the plane / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, <i>k</i>-MST, and Related Problems / rank | |||
Normal rank | |||
Revision as of 17:21, 1 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | APPROXIMATION ALGORITHMS FOR THE EUCLIDEAN TRAVELING SALESMAN PROBLEM WITH DISCRETE AND CONTINUOUS NEIGHBORHOODS |
scientific article |
Statements
APPROXIMATION ALGORITHMS FOR THE EUCLIDEAN TRAVELING SALESMAN PROBLEM WITH DISCRETE AND CONTINUOUS NEIGHBORHOODS (English)
0 references
30 June 2009
0 references
approximation algorithms
0 references
Euclidean traveling salesman problem
0 references
