DMCA
Partial Information Spreading with Application to Distributed Maximum Coverage (2010)
Cached
Download Links
| Citations: | 11 - 1 self |
BibTeX
@MISC{Hillel10partialinformation,
author = {Keren Censor Hillel and Hadas Shachnai},
title = {Partial Information Spreading with Application to Distributed Maximum Coverage },
year = {2010}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
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 should receive n/c messages, for some c ≥ 1. As a key tool in our study we introduce the novel concept of weak conductance, a generalization of classic graph conductance which allows to analyze the time required for partial information spreading. We show the power of weak conductance as a measure of how well-knit the components of a graph are, by giving an example of a graph family for which the conductance is O(n −2), while the weak conductance is as large as 1/2. For such graphs, weak conductance can be used to show that partial information spreading requires time complexity of O(log n). Finally, we demonstrate the usefulness of partial information spreading in solving the maximum coverage problem, which naturally arises in circuit layout, job scheduling and facility location, as well as in distributed resource allocation with a global budget constraint. Our algorithm yields a constant approximation factor and a constant deviation from the given budget. For graphs with a constant weak conductance, this implies a scalable time complexity for solving a problem with a global constraint.
Keyphrases
partial information weak conductance distributed maximum coverage graph family algorithm yield traditional information spreading global budget constraint partial information spreading global constraint facility location scalable time complexity constant approximation factor distributed resource allocation maximum coverage problem constant deviation time complexity key tool classic graph conductance relaxed requirement circuit layout constant weak conductance novel concept job scheduling
