scientific article; zbMATH DE number 1775442
From MaRDI portal
Publication:4542574
zbMath1027.68651MaRDI QIDQ4542574
Satish B. Rao, Warren D. Smith
Publication date: 17 September 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Euclidean Steiner Spanners: Light and Sparse ⋮ On the minimum corridor connection problem and other generalized geometric problems ⋮ A lower bound for approximating the geometric minimum weight matching ⋮ 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 ⋮ Truly Optimal Euclidean Spanners ⋮ Approximate Euclidean Steiner trees ⋮ Geometric spanners with applications in wireless networks ⋮ Covering metric spaces by few trees ⋮ Minimum weight Euclidean \((1+\varepsilon)\)-spanners ⋮ On the longest flip sequence to untangle segments in the plane ⋮ Minimum weight Euclidean \((1+\varepsilon)\)-spanners ⋮ An ETH-Tight Exact Algorithm for Euclidean TSP ⋮ Constant-Factor Approximation for TSP with Disks ⋮ Near-linear-time deterministic plane Steiner spanners for well-spaced point sets ⋮ Improved solution to data gathering with mobile mule ⋮ A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics ⋮ Light Euclidean Spanners with Steiner Points ⋮ A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing ⋮ A polynomial algorithm for a constrained traveling salesman problem ⋮ Steiner trees with bounded RC-delay ⋮ Well-separated pair decomposition in linear time? ⋮ Sensor network topology design and analysis for efficient data gathering by a mobile mule ⋮ Approximation algorithms for the Euclidean bipartite TSP ⋮ 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 ⋮ The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial Time Approximation Scheme ⋮ Covering Metric Spaces by Few Trees ⋮ A randomized Delaunay triangulation heuristic for the Euclidean Steiner tree problem in \(\Re ^{d }\) ⋮ Steiner Shallow-Light Trees Are Exponentially Lighter than Spanning Ones ⋮ Approximation algorithms for lawn mowing and milling ⋮ The traveling salesman problem with few inner points
Uses Software
