Cost of sequential connection for points in space
From MaRDI portal
Recommendations
- On the point-to-point connection problem
- On the connectivity of efficient point sets
- On connectivity spaces
- On connectedness via a sequential method
- scientific article; zbMATH DE number 2245630
- The point-to-point connection problem - analysis and algorithms
- Efficient distance computation in configuration space
- Pathwise Connectivity of the Spatial Numerical Range
- The price of connectivity for feedback vertex set
- The price of connectivity for feedback vertex set
Cites work
- scientific article; zbMATH DE number 3821646 (Why is no real title available?)
- A problem seminar
- An Analysis of Several Heuristics for the Traveling Salesman Problem
- Heuristics Based on Spacefilling Curves for Combinatorial Problems in Euclidean Space
- On the length of optimal TSP circuits in sets of bounded diameter
- Peano curves and smoothness of functions
- Steiner Minimal Trees
- The shortest path and the shortest road through n points
Cited in
(7)- scientific article; zbMATH DE number 3891093 (Why is no real title available?)
- On the asymptotic growth rate of some spanning trees embedded in \(\mathbb R^d\)
- THE NEAREST UNVISITED VERTEX WALK ON RANDOM GRAPHS
- scientific article; zbMATH DE number 4156450 (Why is no real title available?)
- Quantitative two-scale stabilization on the Poisson space
- On the greedy walk problem
- Practical distribution-sensitive point location in triangulations
This page was built for publication: Cost of sequential connection for points in space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1122502)
