Worst-Case Growth Rates of Some Classical Problems of Combinatorial Optimization
- 1 April 1989
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 18 (2) , 278-287
- https://doi.org/10.1137/0218019
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Quantizers and the worst-case Euclidean traveling salesman problemJournal of Combinatorial Theory, Series B, 1990
- On the length of optimal TSP circuits in sets of bounded diameterJournal of Combinatorial Theory, Series B, 1984
- The Travelling Salesman Problem and Minimum Matching in the Unit SquareSIAM Journal on Computing, 1983
- The traveling-salesman problem and minimum spanning trees: Part IIMathematical Programming, 1971
- The Traveling-Salesman Problem and Minimum Spanning TreesOperations Research, 1970
- The shortest path through many pointsMathematical Proceedings of the Cambridge Philosophical Society, 1959
- The shortest path and the shortest road through n pointsMathematika, 1955
- Expected Travel Among Random Points in a RegionCalcutta Statistical Association Bulletin, 1949
- A Lower Bound for the Expected Travel Among $m$ Random PointsThe Annals of Mathematical Statistics, 1948
- ber einen geometrischen SatzMathematische Zeitschrift, 1940