Partial information spreading with application to distributed maximum coverage

This paper addresses partial information spreading among n nodes of a network. As opposed to traditional information spreading, where each node has a message that must be received by all nodes, we propose a relaxed requirement, where only n/c nodes need to receive each message, and every node

• Type: Conference
• Year: 2010
• Where: PODC
• Authors: Keren Censor Hillel, Hadas Shachnai
• Keywords: Distributed And Parallel Computing, N/c Nodes, Partial Information, PODC 2010, Relaxed Requirement