A matching problem and subadditive Euclidean functionals
From MaRDI portal
Recommendations
- Almost sure convergence of the minimum bipartite matching functional in Euclidean space
- scientific article; zbMATH DE number 434648
- Limit theorems and rates of convergence for Euclidean functionals
- On the fluctuations of simple matching
- Convergence of asymptotic costs for random Euclidean matching problems
Cited in
(26)- Euclidean semi-matchings of random samples
- Asymptotics for the length of a minimal triangulation on a random sample
- On the fluctuations of simple matching
- Limit theorems and rates of convergence for Euclidean functionals
- Asymptotics for weighted minimal spanning trees on random points
- 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 measure concentration inequality for contracting Markov chains
- Smoothed analysis of partitioning algorithms for Euclidean functionals
- Generating subtour elimination constraints for the TSP from pure integer solutions
- The radial spanning tree of a Poisson point process
- Ergodic theorems for some classical problems in combinatorial optimization
- Combinatorial Optimization Over Two Random Point Sets
- scientific article; zbMATH DE number 434646 (Why is no real title available?)
- scientific article; zbMATH DE number 434648 (Why is no real title available?)
- Euclidean networks with a backbone and a limit theorem for minimum spanning caterpillars
- Optimal random matchings, tours, and spanning trees in hierarchically separated trees
- scientific article; zbMATH DE number 795116 (Why is no real title available?)
- Limit of the transport capacity of a dense wireless network
- Law of large numbers for a two-dimensional class cover problem
- Scaling laws for maximum coloring of random geometric graphs
- An average case analysis of the minimum spanning tree heuristic for the power assignment problem
- Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem
- A Simple Proof of the $O( \sqrt{n} \log^{3 / 4} n )$ Upright Matching Bound
- Probabilistic properties of highly connected random geometric graphs
This page was built for publication: A matching problem and subadditive Euclidean functionals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1308702)
