American Psychological Association 6th edition

XUEHOU TAN. (2007, January 1). A linear-time 2-approximation algorithm for the watchman route problem for simple polygons. 384(1). Amsterdam: Elsevier, 2007. Retrieved from http://pascal-francis.inist.fr/vibad ndex.php?action=search&terms=19069683

ISO-690 (author-date, English)

XUEHOU TAN, 2007. A linear-time 2-approximation algorithm for the watchman route problem for simple polygons. In: [online]. Amsterdam: Elsevier, 2007. 1 January 2007. Available from: http://pascal-francis.inist.fr/vibad ndex.php?action=search&terms=19069683

Modern Language Association 9th edition

XUEHOU TAN. A linear-time 2-approximation algorithm for the watchman route problem for simple polygons. no. 1, Amsterdam: Elsevier, 2007., 2007, http://pascal-francis.inist.fr/vibad ndex.php?action=search&terms=19069683.

Mohr Siebeck - Recht (Deutsch - Österreich)

Emerald - Harvard

XUEHOU TAN. (2007), “A linear-time 2-approximation algorithm for the watchman route problem for simple polygons”, in , Vol. 384, Amsterdam: Elsevier, 2007., available at: http://pascal-francis.inist.fr/vibad ndex.php?action=search&terms=19069683.

Warning: These citations may not always be 100% accurate.