This paper considers the planar Euclidean two-center problem: given a planar n-point set S, nd two congruent circular disks of the smallest radius covering S. The main result is a deter-ministic algorithm with running time O(n log 2 n log 2 log n), improving the previous O(n log 9 n) bound of Sharir and almost matching the randomized O(n log 2 n) bound of Eppstein. If a point in the intersectio...

Meta-heuristics have received increasing attention in recent years. The present article introduces a novel method in such a class that distinguishes a number of artificial search agents called players within two teams. At each iteration, the active player concerns some other players in both teams to construct its special movements and to get more score. At the end of some iterations (like quart...