Investigating the energy complexity of several well-studied (local) problems in distributed graph algorithms—namely, matching and vertex cover approximations, spanners, low-outdegree orientations, and set cover, presents randomized distributed algorithms that achieve nearly exponentially smaller energy complexity.
Mohsen Ghaffari, Zi Song Yeoh· ACM Symposium on Parallelism...· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.