scientific article; zbMATH DE number 1775442
From MaRDI portal
Publication:4542574
Recommendations
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- Improved Approximations for the Steiner Tree Problem
- CONSTRUCTING MULTIDIMENSIONAL SPANNER GRAPHS
- On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees
- scientific article; zbMATH DE number 1163704
Cited in
(55)- Fast geometric approximation techniques and geometric embedding problems
- Approximation algorithms for lawn mowing and milling
- Sensor network topology design and analysis for efficient data gathering by a mobile mule
- Covering metric spaces by few trees
- Improved solution to data gathering with mobile mule
- On Euclidean vehicle routing with allocation
- A near linear time approximation scheme for Steiner tree among obstacles in the plane
- Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem
- Approximate Euclidean Steiner trees
- Approximation algorithms for the Euclidean bipartite TSP
- The traveling salesman problem with few inner points
- A polynomial algorithm for a constrained traveling salesman problem
- The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme
- A lower bound for approximating the geometric minimum weight matching
- Spanners for geometric intersection graphs with applications
- On a new edge function on complete weighted graphs and its application for locating Hamiltonian cycles of small weight
- Approximation Algorithms for Buy-at-Bulk Geometric Network Design
- Constant-factor approximation for TSP with disks
- A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing
- Euclidean Steiner spanners: light and sparse
- Truly Optimal Euclidean Spanners
- Covering Metric Spaces by Few Trees
- Steiner trees with bounded RC-delay
- Steiner shallow-light trees are exponentially lighter than spanning ones
- Light Euclidean Spanners with Steiner Points
- Minimum weight Euclidean (1+)-spanners
- On the longest flip sequence to untangle segments in the plane
- An ETH-Tight Exact Algorithm for Euclidean TSP
- Minimum weight Euclidean \((1+\varepsilon)\)-spanners
- A unified framework for light spanners
- A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics
- Euclidean TSP in narrow strips
- An improved upper bound for the universal TSP on the grid
- A gap-ETH-tight approximation scheme for Euclidean TSP
- Engineering an algorithm for constructing low-stretch geometric graphs with near-greedy average degrees
- Parameterized algorithms for Steiner forest in bounded width graphs
- A unified framework of light spanners. I: Fast (yet optimal) constructions
- Faster approximation scheme for Euclidean k-TSP
- Parameterized algorithms for \textsc{Steiner Forest} in bounded width graphs
- Truly optimal Euclidean spanners
- Efficient algorithms for Euclidean Steiner minimal tree on near-convex terminal sets
- TSP in a simple polygon
- On approximability of Steiner tree in _p-metrics
- Online Euclidean spanners
- Greedy spanners in Euclidean spaces admit sublinear separators
- On euclidean Steiner (1+)-spanners
- Fast approximation algorithms for Euclidean minimum weight perfect matching
- Light Euclidean Steiner spanners in the plane
- A (5/3+)-approximation for tricolored non-crossing Euclidean TSP
- Euclidean capacitated vehicle routing in the random setting: a 1.55-approximation algorithm
- A randomized Delaunay triangulation heuristic for the Euclidean Steiner tree problem in \(\Re ^{d }\)
- On the minimum corridor connection problem and other generalized geometric problems
- Geometric spanners with applications in wireless networks
- Near-linear-time deterministic plane Steiner spanners for well-spaced point sets
- Well-separated pair decomposition in linear time?
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 Q4542574)
