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

Parikshit Saikia

Browse the full DCOSS paper archive.