The shortest path and the shortest road through n points
From MaRDI portal
Publication:3228026
Cited in
(52)- Quantizers ad the worst case Euclidean traveling salesman problem
- Almost subadditive multiparameter ergodic theorems
- Cost of sequential connection for points in space
- Submodularity and the traveling salesman problem
- Some upper bounds for minimal trees
- A primer of the Euclidean Steiner problem
- The rectilinear Steiner arborescence problem
- Worst-case minimum rectilinear Steiner trees in all dimensions
- A note on lower bounds for rectilinear Steiner trees
- Stacks, queues, and deques with order-statistic operations
- Asymptotic component densities in programmable gate arrays realizing all circuits of a given size
- Nonoscillation theorems in convex sets
- Intersections with random geometric objects
- The chaotic universe
- Continuous approximation models in freight distribution management
- Minimum rectilinear Steiner tree of n points in the unit square
- Worst-case demand distributions in vehicle routing
- On the depth of combinatorial optimization problems
- The RSW theorem for continuum percolation and the CLT for Euclidean minimal spanning trees
- Extremal uniform distribution and random chord lengths
- Gossip algorithms for heterogeneous multi-vehicle routing problems
- On the shortest separating cycle
- On estimating the distribution of optimal traveling salesman tour lengths using heuristics
- Sigma-delta quantization errors and the traveling salesman problem
- Household-level economies of scale in transportation
- Randomized near-neighbor graphs, giant components and applications in data science
- The minimal spanning tree and the upper box dimension
- Euclidean networks with a backbone and a limit theorem for minimum spanning caterpillars
- Watchman tours for polygons with holes
- The Performance of greedy algorithms for the on-line steiner tree and related problems
- On the stretch factor of polygonal chains
- On the stretch factor of polygonal chains
- New Bounds for the Traveling Salesman Constant
- Probabilistic Analysis of Unit-Demand Vehicle Routeing Problems
- Connect the dots: how many random points can a regular curve pass through?
- Minimum weight Euclidean (1+)-spanners
- Continuous approximation formulas for location problems
- Minimum weight Euclidean \((1+\varepsilon)\)-spanners
- On a traveling salesman problem for points in the unit cube
- Observation routes and external watchman routes
- Packing d-dimensional balls into a d + 1-dimensional container
- Two trees are better than one
- Searching in Euclidean spaces with predictions
- Closed curve covering and multiagent TSP ratios
- On euclidean Steiner (1+)-spanners
- Online sorting and online TSP: Randomized, stochastic, and high-dimensional
- The Traveling Bandit: A Framework for Bayesian Optimization with Movement Costs
- Law of large numbers for greedy animals and paths in an ergodic environment
- On the length of optimal TSP circuits in sets of bounded diameter
- The dynamic team forming problem: throughput and delay for unbiased policies
- The minimum backlog problem
- Compatible connectivity augmentation of planar disconnected graphs
This page was built for publication: The shortest path and the shortest road through n points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3228026)
