A -approximation algorithm for metric Max TSP
Approximation algorithms for hitting objects with straight lines
On the minimum diameter spanning tree problem
Information Processing Letters
Discrete Applied Mathematics
Arie Tamir
Shlomi Rubinstein
Nimrod Megiddo
Some new cooperative coverage facility location games
Approximation algorithms for the mobile piercing set problem with applications to clustering in ad-hoc networks
The geometric maximum traveling salesman problem