S. P. Fekete, H. Meijer, A. Rohe and W. Tietze, “Solving a ‘Hard’ Problem to Approximate an ‘Easy’ One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems,” Journal of Experimental Algorithms, Vol. 7, 2002, 11 Pages.

has been cited by the following article:

• TITLE: Longest Hamiltonian in Nodd-Gon

  AUTHORS: Blanca I. Niel

  KEYWORDS: Hamiltonian Path; Extremal Problems; Euclidean Geometric Problem; Farthest Neighbor Tours; Traveling Salesman Problem; Geometry of Odd Regular Polygons

  JOURNAL NAME: Open Journal of Discrete Mathematics, Vol.3 No.2, April 24, 2013

  ABSTRACT: We single out the polygonal paths of nodd -1 order that solve each of the different longest non-cyclic Euclidean Hamiltonian path problems in networks by an arithmetic algorithm. As by product, the procedure determines the winding index of cyclic Hamiltonian polygonals on the vertices of a regular polygon.