Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems.

Sndor P. Fekete, Henk Meijer, Andr Rohe, Walter Tietze

Browse the full ALENEX paper archive.