The message complexity of distributed graph optimization
The message complexity of a distributed algorithm is the total number of messages sent by
all nodes over the course of the algorithm. This paper studies the message complexity of …
all nodes over the course of the algorithm. This paper studies the message complexity of …
Faster Set Cover in the MPC Model
The Massively Parallel Computation (MPC) model is a popular abstraction for large-scale
distributed computing. The Set Cover problem is a classical combinatorial optimization …
distributed computing. The Set Cover problem is a classical combinatorial optimization …
[PDF][PDF] A Survey on Algorithmic Problems in Wireless Systems.
Considering the ongoing growth of Wireless Sensor Networks (WSNs) and the challenges
they pose due to their hardware limitations as well as the intrinsic complexity of their …
they pose due to their hardware limitations as well as the intrinsic complexity of their …
Competitive routing in hybrid communication networks and message efficient SetCover in Ad Hoc networks
C Kolb - 2022 - research.ed.ac.uk
Competitive routing is a challenging problem for wireless ad hoc networks, for example,
when the nodes are mobile, spread so widely, and in the most cases multiple hops and long …
when the nodes are mobile, spread so widely, and in the most cases multiple hops and long …