1 citations · 1 across the 3 of their papers we have counts for
Showing cs.DCShow all
2 papers · 1 filter
cs.DC2022
Near-Shortest Path Routing in Hybrid Communication Networks
Sam Coy, Artur Czumaj, Michael Feldmann +5
Hybrid networks, i.e., networks that leverage different means of communication, become ever more widespread. To allow theoretical study of such networks, [Augustine et al., SODA'20…
cs.DC2019★ 1 cited
Fast Distributed Algorithms for LP-Type Problems of Bounded Dimension
Kristian Hinnenthal, Christian Scheideler, Martijn Struijs
In this paper we present various distributed algorithms for LP-type problems in the well-known gossip model. LP-type problems include many important classes of problems such as (in…