메뉴 건너뛰기




Volumn 17, Issue 1-2, 2000, Pages 25-50

Approximation algorithms for lawn mowing and milling

Author keywords

Approximation algorithms; Computational geometry; Geometric optimization; Lawn mowing; Milling; NC machining; NP completeness; Traveling salesman problem (TSP)

Indexed keywords


EID: 0037894062     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(00)00015-8     Document Type: Article
Times cited : (240)

References (26)
  • 3
    • 0042634954 scopus 로고
    • Approximation algorithms for the geometric covering salesman problem
    • Arkin E.M., Hassin R. Approximation algorithms for the geometric covering salesman problem. Discrete Appl. Math. 55:1994;197-218.
    • (1994) Discrete Appl. Math. , vol.55 , pp. 197-218
    • Arkin, E.M.1    Hassin, R.2
  • 4
    • 8444226342 scopus 로고    scopus 로고
    • Optimization problems related to zigzag pocket machining
    • Arkin E.M., Held M., Smith C.L. Optimization problems related to zigzag pocket machining. Algorithmica. 26:2000;197-236.
    • (2000) Algorithmica , vol.26 , pp. 197-236
    • Arkin, E.M.1    Held, M.2    Smith, C.L.3
  • 7
    • 0041313150 scopus 로고    scopus 로고
    • Nearly linear time approximation schemes for Euclidean TSP and other geometric problems
    • Arora S. Nearly linear time approximation schemes for Euclidean TSP and other geometric problems. J. ACM. 45:(5):1998;1-30.
    • (1998) J. ACM , vol.45 , Issue.5 , pp. 1-30
    • Arora, S.1
  • 8
    • 51249179364 scopus 로고
    • Triangulating a simple polygon in linear time
    • Chazelle B. Triangulating a simple polygon in linear time. Discrete Comput. Geom. 6:1991;485-524.
    • (1991) Discrete Comput. Geom. , vol.6 , pp. 485-524
    • Chazelle, B.1
  • 16
    • 0002737249 scopus 로고
    • Computational complexity and the traveling salesman problem
    • E. Lawler, J. Lenstra, A. Rinnooy Kan, & D. Shmoys. New York: Wiley
    • Johnson D.S., Papadimitriou C.H. Computational complexity and the traveling salesman problem. Lawler E., Lenstra J., Rinnooy Kan A., Shmoys D. The Traveling Salesman Problem. 1985;68-74 Wiley, New York.
    • (1985) The Traveling Salesman Problem , pp. 68-74
    • Johnson, D.S.1    Papadimitriou, C.H.2
  • 18
    • 0039331929 scopus 로고    scopus 로고
    • Guillotine subdivisions approximate polygonal subdivisions: A simple new method for the geometric k-MST problem
    • Mitchell J.S.B. Guillotine subdivisions approximate polygonal subdivisions: A simple new method for the geometric k -MST problem. Proceedings of the 7th ACM-SIAM Symposium on Discrete Algorithms. 1996;402-408.
    • (1996) Proceedings of the 7th ACM-SIAM Symposium on Discrete Algorithms , pp. 402-408
    • Mitchell, J.S.B.1
  • 19
    • 0032667193 scopus 로고    scopus 로고
    • Guillotine subdivisions approximate polygonal subdivisions: A simple polynomial-time approximation scheme for geometric TSP, k-MST, and related problems
    • Mitchell J.S.B. Guillotine subdivisions approximate polygonal subdivisions: A simple polynomial-time approximation scheme for geometric TSP, k -MST, and related problems. SIAM J. Comput. 28:1999;1298-1309.
    • (1999) SIAM J. Comput. , vol.28 , pp. 1298-1309
    • Mitchell, J.S.B.1
  • 21
    • 0001260940 scopus 로고
    • Watchman routes under limited visibility
    • Ntafos S. Watchman routes under limited visibility. Computational Geometry. 1:(3):1992;149-170.
    • (1992) Computational Geometry , vol.1 , Issue.3 , pp. 149-170
    • Ntafos, S.1
  • 25
    • 0024922873 scopus 로고
    • Geometry helps in matching
    • Vaidya P.M. Geometry helps in matching. SIAM J. Comput. 18:1989;1201-1225.
    • (1989) SIAM J. Comput. , vol.18 , pp. 1201-1225
    • Vaidya, P.M.1
  • 26
    • 52449146824 scopus 로고
    • Approximate minimum weight matching on points in k-dimensional space
    • Vaidya P.M. Approximate minimum weight matching on points in k -dimensional space. Algorithmica. 4:1989;569-583.
    • (1989) Algorithmica , vol.4 , pp. 569-583
    • Vaidya, P.M.1


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