{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,17]],"date-time":"2023-10-17T19:26:30Z","timestamp":1697570790826},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1995,12,1]],"date-time":"1995-12-01T00:00:00Z","timestamp":817776000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[1995,12]]},"DOI":"10.1007\/bf02098279","type":"journal-article","created":{"date-parts":[[2005,9,13]],"date-time":"2005-09-13T21:52:12Z","timestamp":1126648332000},"page":"1-20","source":"Crossref","is-referenced-by-count":5,"title":["On properties of geometric random problems in the plane"],"prefix":"10.1007","volume":"61","author":[{"given":"Patrick","family":"Jaillet","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02098279_CR1","volume-title":"Rates of convergence of means for distance-minimizing subadditive Euclidean functionals","author":"K. Alexander","year":"1992","unstructured":"K. Alexander, Rates of convergence of means for distance-minimizing subadditive Euclidean functionals, Department of Mathematics, University of Southern California, Los Angeles (1992), to appear in Annals of Applied Probability."},{"key":"BF02098279_CR2","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1214\/aoap\/1177005773","volume":"2","author":"J. Avram","year":"1992","unstructured":"J. Avram and D. Bertsimas, The minimum spanning tree constant in geometrical probability and under the independent model; a unified approach, Annals of Applied Probability 2(1992)113\u2013130.","journal-title":"Annals of Applied Probability"},{"key":"BF02098279_CR3","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1017\/S0305004100034095","volume":"55","author":"J. Beardwood","year":"1959","unstructured":"J. Beardwood, J. Halton and J. Hammersley, The shortest path through many points, Proc. Camb. Phil. Soc. 55(1959)299\u2013327.","journal-title":"Proc. Camb. Phil. Soc."},{"key":"BF02098279_CR4","unstructured":"J. Bramel and D. Simchi-Levi, Probabilistic analyses and practical algorithms for the vehicle routing problem with time windows, Working Paper, Department of IEOR, Columbia University (1992)."},{"key":"BF02098279_CR5","doi-asserted-by":"crossref","first-page":"1095","DOI":"10.1287\/opre.40.6.1095","volume":"40","author":"J. Bramel","year":"1992","unstructured":"J. Bramel, E. Coffman, P. Shor and D. Simchi-Levi, Probabilistic analysis of algorithms for the capacitated vehicle routing problem with time windows, Operations Research 40(1992)1095\u20131106.","journal-title":"Operations Research"},{"key":"BF02098279_CR6","series-title":"Working Note","volume-title":"On the largest edge in a minimum spanning tree in the square","author":"G. Caplain","year":"1990","unstructured":"G. Caplain and P. Jaillet, On the largest edge in a minimum spanning tree in the square, Working Note, Laboratoire de Math\u00e9matiques et Mod\u00e9lisation, Ecole Nationale des Ponts et Chauss\u00e9es, Paris (1990)."},{"key":"BF02098279_CR7","first-page":"376","volume":"13","author":"E. Gilbert","year":"1965","unstructured":"E. Gilbert, Random minimal trees, Journal of SIAM 13(1965)376\u2013387.","journal-title":"Journal of SIAM"},{"key":"BF02098279_CR8","unstructured":"G. Hardy,Divergent Series (Clarendon Press, 1949)."},{"key":"BF02098279_CR9","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1287\/moor.10.4.527","volume":"10","author":"M. Haimovich","year":"1985","unstructured":"M. Haimovich and A. Rinnooy Kan, Bounds and heuristics for capacitated routing problems, Mathematics of Operations Research 10(1985)527\u2013542.","journal-title":"Mathematics of Operations Research"},{"key":"BF02098279_CR10","series-title":"Studies in Management Science and Systems","volume-title":"Vehicle Routing: Methods and Studies","author":"M. Haimovich","year":"1988","unstructured":"M. Haimovich, A. Rinnooy Kan and L. Stougie, Analysis of heuristics for vehicle routing problems, in:Vehicle Routing: Methods and Studies, eds. B. Golden and A. Assad, Studies in Management Science and Systems 16 (North-Holland, Amsterdam 1988)."},{"key":"BF02098279_CR11","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1137\/0211003","volume":"11","author":"J. Halton","year":"1982","unstructured":"J. Halton and R. Terada, A fast algorithm for the Euclidean traveling salesman problem, optimal with probability one, SIAM Journal of Computing 11(1982)29\u201346.","journal-title":"SIAM Journal of Computing"},{"key":"BF02098279_CR12","first-page":"675","volume-title":"Operational Research 90","author":"P. Jaillet","year":"1991","unstructured":"P. Jaillet, Probabilistic routing problems in the plane, in:Operational Research 90, ed. H. Bradley (Pergamon Press, London, 1991) pp. 675\u2013688."},{"key":"BF02098279_CR13","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1287\/moor.17.4.964","volume":"17","author":"P. Jaillet","year":"1992","unstructured":"P. Jaillet, Rates of convergence for quasi-additive smooth Euclidean functionals and applications to combinatorial optimization problems, Mathematics of Operations Research 17(1992)965\u2013980.","journal-title":"Mathematics of Operations Research"},{"key":"BF02098279_CR14","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1287\/moor.18.1.51","volume":"18","author":"P. Jaillet","year":"1993","unstructured":"P. Jaillet, Analysis of probabilistic combinatorial optimization problems in Euclidean spaces, Mathematics of Operations Research 18(1993)51\u201371.","journal-title":"Mathematics of Operations Research"},{"key":"BF02098279_CR15","doi-asserted-by":"crossref","first-page":"582","DOI":"10.1214\/aoap\/1177005439","volume":"3","author":"P. Jaillet","year":"1993","unstructured":"P. Jaillet, Cube versus torus models for combinatorial optimization problems and the Euclidean minimum spanning tree constant, Annals of Applied Probability 3(1993)582\u2013592.","journal-title":"Annals of Applied Probability"},{"key":"BF02098279_CR16","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0167-6377(93)90098-2","volume":"14","author":"P. Jaillet","year":"1993","unstructured":"P. Jaillet, Rate of convergence for the Euclidean minimum spanning tree limit law, Operations Research Letters 14(1993)73\u201378.","journal-title":"Operations Research Letters"},{"key":"BF02098279_CR17","unstructured":"D. Johnson, private communication, Bell Labs. (1993)."},{"key":"BF02098279_CR18","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1287\/moor.2.3.209","volume":"2","author":"R. Karp","year":"1985","unstructured":"R. Karp, Probabilistic analysis of partitioning algorithms for the traveling salesman problem in the plane, Mathematics of Operations Research 2(1985)209\u2013224.","journal-title":"Mathematics of Operations Research"},{"key":"BF02098279_CR19","volume-title":"The Traveling Salesman Problem","author":"R. Karp","year":"1985","unstructured":"R. Karp and J. Steele, Probabilistic analysis of heuristics, in:The Traveling Salesman Problem, eds. E. Lawler, J. Lenstra, A. Rinnooy Kan and D. Shmoys (Wiley, Chichester, 1985)."},{"key":"BF02098279_CR20","unstructured":"C. Papadimitriou, The probabilistic analysis of matching heuristics,Proc. 15th Annual Conf. Comm. Contr. Comp. (1978) pp. 368\u2013378."},{"key":"BF02098279_CR21","volume-title":"Urban Operations Research","author":"R. Larson","year":"1981","unstructured":"R. Larson and A. Odoni,Urban Operations Research (Prentice-Hall, NJ, 1981)."},{"key":"BF02098279_CR22","volume-title":"The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization","year":"1985","unstructured":"E. Lawler, J. Lenstra, A. Rinnooy Kan and D. Shmoys (eds.),The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization (Wiley, Chichester, 1985)."},{"key":"BF02098279_CR23","doi-asserted-by":"crossref","first-page":"719","DOI":"10.1145\/76359.76361","volume":"36","author":"L. Platzman","year":"1989","unstructured":"L. Platzman and J. Bartholdi III, Spacefilling curves and the planar travelling salesman problem, Journal of ACM 36(1989)719\u2013737.","journal-title":"Journal of ACM"},{"key":"BF02098279_CR24","volume-title":"Limit theorems and rates of convergence for Euclidean functionals","author":"C. Redmond","year":"1993","unstructured":"C. Redmond and J. Yukich, Limit theorems and rates of convergence for Euclidean functionals, Department of Mathematics, University of Amherst, MA (1993)."},{"key":"BF02098279_CR25","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1287\/moor.16.3.482","volume":"16","author":"W. Rhee","year":"1991","unstructured":"W. Rhee, On the fluctuations of the stochastic traveling salesperson problem, Mathematics of Operations Research 16(1991)482\u2013489.","journal-title":"Mathematics of Operations Research"},{"key":"BF02098279_CR26","unstructured":"W. Rhee, Boundary effects in the travelling salesperson problem, Department of Management Science, The Ohio State University, Columbus (1992), to appear in Operations Research Letters."},{"key":"BF02098279_CR27","volume-title":"Department of Management Science","author":"W. Rhee","year":"1992","unstructured":"W. Rhee, Department of Management Science, The Ohio State University, Columbus (1992)."},{"key":"BF02098279_CR28","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1287\/moor.12.1.177","volume":"12","author":"W. Rhee","year":"1987","unstructured":"W. Rhee and M. Talagrand, Martingale inequalities and NP-complete problems, Mathematics of Operations Research 12(1987)177\u2013181.","journal-title":"Mathematics of Operations Research"},{"key":"BF02098279_CR29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1214\/aop\/1176991490","volume":"17","author":"W. Rhee","year":"1988","unstructured":"W. Rhee and M. Talagrand, A sharp deviation inequality for the stochastic traveling salesman problem, Annals of Probability 17(1988)1\u20138.","journal-title":"Annals of Probability"},{"key":"BF02098279_CR30","first-page":"205","volume":"1","author":"R. Schmidt","year":"1925","unstructured":"R. Schmidt, Uber das Borelsche Summierungsverfahren, Schriften d. K\u00f6nigsberger gel. Gesellschaft 1(1925)205\u2013256.","journal-title":"Schriften d. K\u00f6nigsberger gel. Gesellschaft"},{"key":"BF02098279_CR31","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1214\/aop\/1176994411","volume":"9","author":"J. Steele","year":"1981","unstructured":"J. Steele, Subadditive Euclidean functionals and nonlinear growth in geometric probability, Annals of Probability 9(1981)365\u2013376.","journal-title":"Annals of Probability"},{"key":"BF02098279_CR32","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1287\/moor.6.3.374","volume":"6","author":"J. Steele","year":"1981","unstructured":"J. Steele, Complete convergence of short paths and Karp's algorithm for the TSP, Mathematics of Operations Research 6(1981)374\u2013378.","journal-title":"Mathematics of Operations Research"},{"key":"BF02098279_CR33","doi-asserted-by":"crossref","first-page":"1767","DOI":"10.1214\/aop\/1176991596","volume":"16","author":"J. Steele","year":"1988","unstructured":"J. Steele, Growth rates of Euclidean minimal spanning trees with power weighted edges, Annals of Probability 16(1988)1767\u20131787.","journal-title":"Annals of Probability"},{"key":"BF02098279_CR34","doi-asserted-by":"crossref","unstructured":"J. Steele and L. Snyder, Worst-case greedy matchings in the unitd-cube, SIAM Journal of Computing 18(198)278\u2013287.","DOI":"10.1137\/0218019"},{"key":"BF02098279_CR35","doi-asserted-by":"crossref","unstructured":"J. Steele and L. Tierney, Boundary domination and the distribution of the largest nearest-neighbor link in higher dimensions, Journal of Applied Probability 23(1986)524\u2264\u2013528.","DOI":"10.2307\/3214195"},{"key":"BF02098279_CR36","doi-asserted-by":"crossref","first-page":"809","DOI":"10.2307\/3214207","volume":"24","author":"J. Steele","year":"1986","unstructured":"J. Steele, L. Shepp and W. Eddy, On the number of leaves of a Euclidean minimal spanning tree, Journal of Applied Probability 24(1986)809\u2013826.","journal-title":"Journal of Applied Probability"},{"key":"BF02098279_CR37","unstructured":"B. Weide, Statistical methods in algorithm design and analysis, Ph.D. Dissertation, Computer Science Department, Carnegie-Mellon University (1978)."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02098279.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02098279\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02098279","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T12:04:28Z","timestamp":1586433868000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02098279"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,12]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,12]]}},"alternative-id":["BF02098279"],"URL":"https:\/\/doi.org\/10.1007\/bf02098279","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,12]]}}}