A maximum b-matching problem arising from median location models with applications to the roommates problem

On minimum stars, minimum Steiner stars, and maximum matchings

SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry

Simplicity and hardness of the maximum traveling salesman problem under geometric distances

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms

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

ALENEX '01 Revised Papers from the Third International Workshop on Algorithm Engineering and Experimentation

The geometric maximum traveling salesman problem

Journal of the ACM (JACM)

Solving a "Hard" problem to approximate an "Easy" one: heuristics for maximum matchings and maximum traveling salesman problems

Journal of Experimental Algorithmics (JEA)