Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems. - Sándor P. Fekete; Henk Meijer; André Rohe; Walter Tietze (ACM J. Exp. Algorithmics, 2002)