Worst-Case Growth Rates of Some Classical Problems of Combinatorial Optimization
From MaRDI portal
asymptotic worst-case behaviorlength of a minimal spanning treeoptimal traveling salesman tourunit d-cube
Trees (05C05) Extremal problems in graph theory (05C35) Inequalities and extremum problems involving convexity in convex geometry (52A40) Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)
Recommendations
- Probabilistic and Worst Case Analyses of Classical Problems of Combinatorial Optimization in Euclidean Space
- Worst case asymptotics for some classical optimization problems
- Equidistribution in all Dimensions of Worst-case Point Sets for the Traveling Salesman Problem
- Worst-case analysis of a new heuristic for the travelling salesman problem
- scientific article; zbMATH DE number 4167872
Cited in
(12)- Quantizers ad the worst case Euclidean traveling salesman problem
- Worst-case minimum rectilinear Steiner trees in all dimensions
- Worst case asymptotics for some classical optimization problems
- On properties of geometric random problems in the plane
- Curve based approximation of measures on manifolds by discrepancy minimization
- Practical distribution-sensitive point location in triangulations
- Euclidean Steiner spanners: light and sparse
- Minimum weight Euclidean (1+)-spanners
- Minimum weight Euclidean \((1+\varepsilon)\)-spanners
- On the asymptotic growth rate of some spanning trees embedded in \(\mathbb R^d\)
- Aspects of a randomly growing cluster in \(\mathbb{R}^d\), \(d \geq 2\)
- On euclidean Steiner (1+)-spanners
This page was built for publication: Worst-Case Growth Rates of Some Classical Problems of Combinatorial Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3829359)
