On properties of geometric random problems in the plane
From MaRDI portal
Publication:1908291
DOI10.1007/BF02098279zbMath0839.90133MaRDI QIDQ1908291
Publication date: 26 February 1996
Published in: Annals of Operations Research (Search for Journal in Brave)
traveling salesmanSteiner tree problemrates of convergenceminimum spanning treeminimum weight matchinggeometric random problems
Related Items (3)
A Fractal Dimension for Measures via Persistent Homology ⋮ Thresholding random geometric graph properties motivated by ad hoc sensor networks ⋮ Limit theory of combinatorial optimization for random geometric graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cube versus torus models and the Euclidean minimum spanning tree constant
- Growth rates of Euclidean minimal spanning trees with power weighted edges
- Subadditive Euclidean functionals and nonlinear growth in geometric probability
- The minimum spanning tree constant in geometrical probability and under the independent model: A unified approach
- Rate of convergence for the Euclidean minimum spanning tree limit law
- Limit theorems and rates of convergence for Euclidean functionals
- A sharp deviation inequality for the stochastic traveling salesman problem
- Spacefilling curves and the planar travelling salesman problem
- Bounds and Heuristics for Capacitated Routing Problems
- Boundary domination and the distribution of the largest nearest-neighbor link in higher dimensions
- On the number of leaves of a euclidean minimal spanning tree
- Worst-Case Growth Rates of Some Classical Problems of Combinatorial Optimization
- A Fast Algorithm for the Euclidean Traveling Salesman Problem, Optimal with Probability One
- Complete Convergence of Short Paths and Karp's Algorithm for the TSP
- On the Fluctuations of the Stochastic Traveling Salesperson Problem
- On the Travelling Salesperson Problem in Many Dimensions
- Rates of Convergence for Quasi-Additive Smooth Euclidean Functionals and Application to Combinatorial Optimization Problems
- Probabilistic Analysis of the Capacitated Vehicle Routing Problem with Unsplit Demands
- Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
- Analysis of Probabilistic Combinatorial Optimization Problems in Euclidean Spaces
- Random Minimal Trees
- Probabilistic Analyses and Practical Algorithms for the Vehicle Routing Problem with Time Windows
- Martingale Inequalities and NP-Complete Problems
This page was built for publication: On properties of geometric random problems in the plane