An O(1)-rounds Deterministic Distributed Approximation Algorithm for the Traveling Salesman Problem in Congested Clique.
Parikshit SaikiaPublished in: DCOSS-IoT (2024)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- ant colony optimization
- objective function
- dynamic programming
- hamiltonian cycle
- computational complexity
- benchmark problems
- minimum spanning tree
- discrete particle swarm optimization
- cost function
- ant colony optimization algorithm
- np hard
- expectation maximization
- optimal solution
- genetic algorithm
- aco algorithm
- quadratic assignment problem
- traveling salesman