Worst case asymptotics for some classical optimization problems

DOI10.1007/BF01271275zbMath0881.05065OpenAlexW1966155527MaRDI QIDQ1375702

Joseph E. Yukich

Publication date: 11 January 1998

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01271275

zbMATH Keywords

combinatorial optimization

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Integer programming (90C10) Inequalities and extremum problems involving convexity in convex geometry (52A40)

Related Items

On the asymptotic growth rate of some spanning trees embedded in \(\mathbb R^d\) ⋮ The minimal spanning tree and the upper box dimension

Cites Work

• Unnamed Item
• Subadditive Euclidean functionals and nonlinear growth in geometric probability
• Limit theorems and rates of convergence for Euclidean functionals
• Asymptotics for the Euclidean TSP with power weighted edges
• Asymptotics for Euclidean functionals with power-weighted edges
• Ergodic theorems for some classical problems in combinatorial optimization
• Worst-case greedy matchings in the unitd-cube
• Worst-Case Growth Rates of Some Classical Problems of Combinatorial Optimization