scientific article; zbMATH DE number 1163704
From MaRDI portal
Publication:4395317
Recommendations
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- scientific article; zbMATH DE number 2080248
- Traveling salesman problem of segments
- TRAVELING SALESMAN PROBLEM OF SEGMENTS
- On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees
Cited in
(28)- Faster geometric \(k\)-point MST approximation
- On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees
- Approximation schemes for NP-hard geometric optimization problems: a survey
- Approximation algorithms for lawn mowing and milling
- Faster algorithms for orienteering and \(k\)-TSP
- Randomized approximation scheme for Steiner multi cycle in the Euclidean plane
- Euclidean TSP on two polygons
- Good triangulations yield good tours
- Approximation algorithms for the Euclidean bipartite TSP
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
- The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme
- On the efficiency of polynomial time approximation schemes
- Performance guarantees for the TSP with a parameterized triangle inequality
- Traveling salesman problem of segments
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- Efficient Algorithms for Fixed-Precision Instances of Bin Packing and Euclidean TSP
- A Linear-Time Approximation Scheme for TSP in Undirected Planar Graphs with Edge-Weights
- Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
- scientific article; zbMATH DE number 1775442 (Why is no real title available?)
- Confronting intractability via parameters
- TRAVELING SALESMAN PROBLEM OF SEGMENTS
- On the empirical time complexity of finding optimal solutions vs proving optimality for Euclidean TSP instances
- The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme
- Euclidean TSP in narrow strips
- An ETH-Tight Exact Algorithm for Euclidean TSP
- Exponential time approximation scheme for TSP
- On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees
- On the minimum corridor connection problem and other generalized geometric problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4395317)
