Ergodic theorems for some classical problems in combinatorial optimization
From MaRDI portal
Publication:2564700
DOI10.1214/aoap/1034968238zbMath0866.60027OpenAlexW2026265169MaRDI QIDQ2564700
Publication date: 8 July 1997
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aoap/1034968238
Geometric probability and stochastic geometry (60D05) Strong limit theorems (60F15) Combinatorial probability (60C05)
Related Items
Asymptotics for Euclidean functionals with power-weighted edges ⋮ Worst case asymptotics for some classical optimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Uniform pointwise ergodic theorems for classes of averaging sets and multiparameter subadditive processes
- Growth rates of Euclidean minimal spanning trees with power weighted edges
- Subadditive Euclidean functionals and nonlinear growth in geometric probability
- Euclidean semi-matchings of random samples
- The minimum spanning tree constant in geometrical probability and under the independent model: A unified approach
- Asymptotics for Euclidean minimal spanning trees on random points
- Multiparameter subadditive processes
- A matching problem and subadditive Euclidean functionals
- Limit theorems and rates of convergence for Euclidean functionals
- Asymptotics for the Euclidean TSP with power weighted edges
- Concentration of measure and isoperimetric inequalities in product spaces
- Asymptotics for Euclidean functionals with power-weighted edges
- A new look at independence
- Ergodic theorems for superadditive processes.
- Steinhaus's geometric location problem for random samples in the plane
- New concentration inequalities in product spaces
