메뉴 건너뛰기




Volumn 61, Issue 1, 1995, Pages 1-20

On properties of geometric random problems in the plane

Author keywords

Euclidean and probabilistic analyses; geometric constants; minimum spanning tree; rates of convergence; Traveling salesman

Indexed keywords


EID: 21844501411     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/BF02098279     Document Type: Article
Times cited : (9)

References (37)
  • 4
    • 84936460648 scopus 로고    scopus 로고
    • 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).
  • 8
    • 84936460654 scopus 로고    scopus 로고
    • G. Hardy, Divergent Series (Clarendon Press, 1949).
  • 17
    • 84936460655 scopus 로고    scopus 로고
    • D. Johnson, private communication, Bell Labs. (1993).
  • 20
    • 84936460652 scopus 로고    scopus 로고
    • C. Papadimitriou, The probabilistic analysis of matching heuristics, Proc. 15th Annual Conf. Comm. Contr. Comp. (1978) pp. 368–378.
  • 26
    • 84936460668 scopus 로고    scopus 로고
    • 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.
  • 34
    • 84936460669 scopus 로고    scopus 로고
    • J. Steele and L. Snyder, Worst-case greedy matchings in the unit d-cube, SIAM Journal of Computing 18(198)278–287.
  • 35
    • 84936460675 scopus 로고    scopus 로고
    • 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≤–528.
  • 37
    • 84936460674 scopus 로고    scopus 로고
    • B. Weide, Statistical methods in algorithm design and analysis, Ph.D. Dissertation, Computer Science Department, Carnegie-Mellon University (1978).


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.