scientific article; zbMATH DE number 1775442
From MaRDI portal
Publication:4542574
zbMATH Open1027.68651MaRDI QIDQ4542574FDOQ4542574
Authors: Satish Rao, Warren D. Smith 
Publication date: 17 September 2002
Title of this publication is not available (Why is that?)
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 (38)
- Steiner shallow-light trees are exponentially lighter than spanning ones
- Euclidean Steiner spanners: light and sparse
- Fast geometric approximation techniques and geometric embedding problems
- Covering Metric Spaces by Few Trees
- Minimum weight Euclidean \((1+\varepsilon)\)-spanners
- Sensor network topology design and analysis for efficient data gathering by a mobile mule
- Approximation algorithms for the Euclidean bipartite TSP
- A lower bound for approximating the geometric minimum weight matching
- A near linear time approximation scheme for Steiner tree among obstacles in the plane
- Spanners for geometric intersection graphs with applications
- Geometric spanners with applications in wireless networks
- Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem
- A polynomial algorithm for a constrained traveling salesman problem
- On a new edge function on complete weighted graphs and its application for locating Hamiltonian cycles of small weight
- Approximation algorithms for lawn mowing and milling
- Truly Optimal Euclidean Spanners
- Constant-factor approximation for TSP with disks
- On Euclidean vehicle routing with allocation
- An improved upper bound for the universal TSP on the grid
- On the minimum corridor connection problem and other generalized geometric problems
- Minimum weight Euclidean \((1+\varepsilon)\)-spanners
- Covering metric spaces by few trees
- A randomized Delaunay triangulation heuristic for the Euclidean Steiner tree problem in \(\Re ^{d }\)
- Near-linear-time deterministic plane Steiner spanners for well-spaced point sets
- Approximate Euclidean Steiner trees
- On the longest flip sequence to untangle segments in the plane
- A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing
- A unified framework for light spanners
- The traveling salesman problem with few inner points
- The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme
- Light Euclidean Spanners with Steiner Points
- A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics
- Euclidean TSP in narrow strips
- Well-separated pair decomposition in linear time?
- Approximation Algorithms for Buy-at-Bulk Geometric Network Design
- An ETH-Tight Exact Algorithm for Euclidean TSP
- Improved solution to data gathering with mobile mule
- Steiner trees with bounded RC-delay
Uses Software
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)
