Partial information spreading with application to distributed maximum coverage

DOI10.1145/1835698.1835739zbMath1315.68007OpenAlexW2159505833MaRDI QIDQ5176196

Keren Censor-Hillel, Hadas Shachnai

Publication date: 2 March 2015

Published in: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1835698.1835739

zbMATH Keywords

distributed computingapproximation algorithmsrandomized algorithmsmaximum coverageweak conductancepartial information spreading

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Approximation algorithms (68W25) Randomized algorithms (68W20) Distributed algorithms (68W15)

Related Items (7)

Leader nodes in communities for information spreading ⋮ The worst case behavior of randomized gossip protocols ⋮ Xheal: a localized self-healing algorithm using expanders ⋮ Faster rumor spreading with multiple calls ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Distributed agreement in dynamic peer-to-peer networks

Uses Software

• CCSTM

Cites Work

• Elastic Transactions
• Toward a theory of transactional contention managers
• Software transactional memory

This page was built for publication: Partial information spreading with application to distributed maximum coverage