Cost of sequential connection for points in space
From MaRDI portal
Publication:1122502
DOI10.1016/0167-6377(89)90039-4zbMATH Open0675.90084OpenAlexW2101027188MaRDI QIDQ1122502FDOQ1122502
Authors: J. Michael Steele 
Publication date: 1989
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(89)90039-4
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
Programming involving graphs or networks (90C35) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- An Analysis of Several Heuristics for the Traveling Salesman Problem
- Steiner Minimal Trees
- The shortest path and the shortest road through n points
- Heuristics Based on Spacefilling Curves for Combinatorial Problems in Euclidean Space
- A problem seminar
- On the length of optimal TSP circuits in sets of bounded diameter
- Title not available (Why is that?)
- Peano curves and smoothness of functions
Cited In (7)
- Practical distribution-sensitive point location in triangulations
- On the asymptotic growth rate of some spanning trees embedded in \(\mathbb R^d\)
- THE NEAREST UNVISITED VERTEX WALK ON RANDOM GRAPHS
- Title not available (Why is that?)
- Quantitative two-scale stabilization on the Poisson space
- On the greedy walk problem
- Title not available (Why is that?)
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)
