Worst case asymptotics for some classical optimization problems
From MaRDI portal
Recommendations
- Worst-Case Growth Rates of Some Classical Problems of Combinatorial Optimization
- Probabilistic and Worst Case Analyses of Classical Problems of Combinatorial Optimization in Euclidean Space
- scientific article; zbMATH DE number 4167872
- An asymptotic determination of the minimum spanning tree and minimum matching constants in geometrical probability
- Worst case asymptotics of power-weighted Euclidean functionals
Cites work
- scientific article; zbMATH DE number 3193293 (Why is no real title available?)
- Asymptotics for Euclidean functionals with power-weighted edges
- Asymptotics for the Euclidean TSP with power weighted edges
- Ergodic theorems for some classical problems in combinatorial optimization
- Limit theorems and rates of convergence for Euclidean functionals
- Subadditive Euclidean functionals and nonlinear growth in geometric probability
- Worst-Case Growth Rates of Some Classical Problems of Combinatorial Optimization
- Worst-case greedy matchings in the unitd-cube
Cited in
(5)- Worst-Case Growth Rates of Some Classical Problems of Combinatorial Optimization
- The minimal spanning tree and the upper box dimension
- Combinatorial optimization problems in ultrametric spaces
- scientific article; zbMATH DE number 4167872 (Why is no real title available?)
- On the asymptotic growth rate of some spanning trees embedded in \(\mathbb R^d\)
This page was built for publication: Worst case asymptotics for some classical optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1375702)
