"An O(1)-rounds Deterministic Distributed Approximation Algorithm for the ..."

Parikshit Saikia (2024)

> Home

Details and statistics

DOI: 10.1109/DCOSS-IOT61029.2024.00034

access: closed

type: Conference or Workshop Paper

metadata version: 2024-08-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/dcoss/Saikia24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dcoss/Saikia24
Parikshit Saikia:
An O(1)-rounds Deterministic Distributed Approximation Algorithm for the Traveling Salesman Problem in Congested Clique. DCOSS-IoT 2024: 179-186

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.