The following pages link to (Q4542574):
Displaying 34 items.
- A lower bound for approximating the geometric minimum weight matching (Q294775) (← links)
- On a new edge function on complete weighted graphs and its application for locating Hamiltonian cycles of small weight (Q315484) (← links)
- A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing (Q494936) (← links)
- Steiner trees with bounded RC-delay (Q527413) (← links)
- A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics (Q650109) (← links)
- A randomized Delaunay triangulation heuristic for the Euclidean Steiner tree problem in \(\Re ^{d }\) (Q763244) (← links)
- On the minimum corridor connection problem and other generalized geometric problems (Q833722) (← links)
- Geometric spanners with applications in wireless networks (Q868107) (← links)
- Near-linear-time deterministic plane Steiner spanners for well-spaced point sets (Q906836) (← links)
- Well-separated pair decomposition in linear time? (Q963421) (← links)
- Approximation algorithms for lawn mowing and milling (Q1841242) (← links)
- Sensor network topology design and analysis for efficient data gathering by a mobile mule (Q2006940) (← links)
- Covering metric spaces by few trees (Q2168848) (← links)
- Improved solution to data gathering with mobile mule (Q2205629) (← links)
- On Euclidean vehicle routing with allocation (Q2269139) (← links)
- A near linear time approximation scheme for Steiner tree among obstacles in the plane (Q2269141) (← links)
- Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem (Q2292156) (← links)
- Approximate Euclidean Steiner trees (Q2397467) (← links)
- Approximation algorithms for the Euclidean bipartite TSP (Q2488237) (← links)
- The traveling salesman problem with few inner points (Q2583717) (← links)
- A polynomial algorithm for a constrained traveling salesman problem (Q2748381) (← links)
- The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme (Q2817793) (← links)
- Spanners for geometric intersection graphs with applications (Q2968085) (← links)
- Approximation Algorithms for Buy-at-Bulk Geometric Network Design (Q3183450) (← links)
- Constant-Factor Approximation for TSP with Disks (Q4604382) (← links)
- Euclidean Steiner Spanners: Light and Sparse (Q5043642) (← links)
- Truly Optimal Euclidean Spanners (Q5071083) (← links)
- Covering Metric Spaces by Few Trees (Q5091169) (← links)
- Steiner Shallow-Light Trees Are Exponentially Lighter than Spanning Ones (Q5502177) (← links)
- Light Euclidean Spanners with Steiner Points (Q5874539) (← links)
- An ETH-Tight Exact Algorithm for Euclidean TSP (Q6156029) (← links)
- Minimum weight Euclidean \((1+\varepsilon)\)-spanners (Q6201907) (← links)
- Euclidean TSP in narrow strips (Q6541986) (← links)
- An improved upper bound for the universal TSP on the grid (Q6621749) (← links)
