Worst-Case Growth Rates of Some Classical Problems of Combinatorial Optimization
DOI10.1137/0218019zbMath0674.90080OpenAlexW2011240422MaRDI QIDQ3829359
Timothy Law Snyder, J. Michael Steele
Publication date: 1989
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://repository.upenn.edu/cgi/viewcontent.cgi?article=1048&context=oid_papers
optimal traveling salesman tourlength of a minimal spanning treeasymptotic worst-case behaviorunit d-cube
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Extremal problems in graph theory (05C35) Integer programming (90C10) Combinatorial optimization (90C27) Inequalities and extremum problems involving convexity in convex geometry (52A40)
Related Items (10)
This page was built for publication: Worst-Case Growth Rates of Some Classical Problems of Combinatorial Optimization