Back to Results
First PageMeta Content
Probability theory / Algebraic graph theory / Network flow / Conductance / Matrices / Connectivity / Randomized algorithm / Degree / Flow network / Graph theory / Mathematics / Theoretical computer science


Partial Information Spreading with Application to Distributed Maximum Coverage Keren Censor Hillel∗ and Hadas Shachnai† Department of Computer Science, Technion Haifa 32000, Israel February 18, 2010
Add to Reading List

Document Date: 2010-02-18 13:16:53


Open Document

File Size: 237,81 KB

Share Result on Facebook

City

Haifa / /

Country

Israel / /

Currency

cent / /

/

IndustryTerm

partial information spreading algorithm / constant-approximation algorithm / maximum coverage algorithm / approximation algorithm / distributed algorithm / ad-hoc and mobile networks / constant factor approximation algorithm / distributed computing / Information spreading algorithms / social networks / computing / communication networks / information spreading algorithm / approximation algorithms / radio networks / /

Organization

Israel Science Foundation / Distributed Maximum Coverage Keren Censor Hillel∗ and Hadas Shachnai† Department of Computer Science / Israel Academy of Sciences and Humanities / Technion / /

Person

Pi / Keren Censor Hillel / /

Position

push/pull model of communication / synchronous push/pull model of communication / model of communication / /

Product

Pentax K-x Digital Camera / /

Technology

distributed algorithm / randomized algorithm / 0 The algorithm / approximation algorithm / spreading algorithm / 8 Algorithm / partial information spreading algorithm / information spreading algorithm / 1 Algorithm / Information spreading algorithms / maximum coverage algorithm / approximation algorithms / constant factor approximation algorithm / same algorithm / constant-approximation algorithm / links.2 Our algorithm / /

SocialTag