An O(1)-rounds Deterministic Distributed Approximation Algorithm for the Traveling Salesman Problem in Congested Clique

We study the Traveling Salesman Problem (TSP) in the Congested Clique Model (CCM) of distributed computing. We present a deterministic distributed algorithm that computes a tour for the TSP using O(1) rounds and O(m) messages for a given undirected weighted complete graph of n nodes and m edges with an approximation factor 2 of the optimal. The TSP has wide applications in logistics, planning, manufacturing and testing microchips, DNA sequencing etc., and we claim that our proposed O(1)-rounds approximation algorithm to the TSP, which is fast and efficient, can also be used to minimize the energy consumption in Wireless Sensor Networks.