Sándor P. Fekete, Henk Meijer, André Rohe, Walter Tietze. Solving a Hard Problem to Approximate an Easy One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems. ACM Journal of Experimental Algorithmics, 7:11, 2002. [doi]
@article{FeketeMRT02,
title = {Solving a Hard Problem to Approximate an Easy One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems},
author = {Sándor P. Fekete and Henk Meijer and André Rohe and Walter Tietze},
year = {2002},
url = {http://www.jea.acm.org/2002/FeketeHeuristics},
researchr = {https://researchr.org/publication/FeketeMRT02},
cites = {0},
citedby = {0},
journal = {ACM Journal of Experimental Algorithmics},
volume = {7},
pages = {11},
}