Partial information spreading with application to distributed maximum coverage
暂无分享,去创建一个
[1] Joseph Naor,et al. Coping with Interference: From Maximum Coverage to Planning Cellular Networks , 2006, WAOA.
[2] Rakesh V. Vohra,et al. A Probabilistic Analysis of the Maximal Covering Location Problem , 1993, Discret. Appl. Math..
[3] Samir Khuller,et al. The Budgeted Maximum Coverage Problem , 1999, Inf. Process. Lett..
[4] Rachid Guerraoui,et al. On the complexity of asynchronous gossip , 2008, PODC '08.
[5] D. Hochbaum,et al. Analysis of the greedy approach in problems of maximum k‐coverage , 1998 .
[6] Alistair Sinclair,et al. Algorithms for Random Generation and Counting: A Markov Chain Approach , 1993, Progress in Theoretical Computer Science.
[7] Chen Avin,et al. Bounds on the mixing time and partial cover of ad-hoc and sensor networks , 2005, Proceeedings of the Second European Workshop on Wireless Sensor Networks, 2005..
[8] Johannes Gehrke,et al. Gossip-based computation of aggregate information , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[9] Gérard Cornuéjols,et al. Submodular set functions, matroids and the greedy algorithm: Tight worst-case bounds and some generalizations of the Rado-Edmonds theorem , 1984, Discret. Appl. Math..
[10] Christos Koufogiannakis,et al. Distributed and parallel algorithms for weighted vertex cover and other covering problems , 2009, PODC '09.
[11] Stéphane Pérennes,et al. Assigning labels in unknown anonymous networks (extended abstract) , 2000, PODC '00.
[12] László Lovász,et al. Blocking Conductance and Mixing in Random Walks , 2006, Combinatorics, Probability and Computing.
[13] David S. Johnson,et al. `` Strong '' NP-Completeness Results: Motivation, Examples, and Implications , 1978, JACM.
[14] Fabrizio Grandoni,et al. Distributed weighted vertex cover via maximal matchings , 2005, TALG.
[15] Kunihiko Sadakane,et al. The space complexity of the leader election in anonymous networks , 2008, IPDPS.
[16] Devavrat Shah,et al. Information Dissemination via Network Coding , 2006, 2006 IEEE International Symposium on Information Theory.
[17] G. Nemhauser,et al. Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms* , 1981 .
[18] D. Hochbaum. Approximating covering and packing problems: set cover, vertex cover, independent set, and related problems , 1996 .
[19] Eli Upfal,et al. Randomized Broadcast in Networks , 1990, Random Struct. Algorithms.
[20] László Lovász,et al. Faster mixing via average conductance , 1999, STOC '99.
[21] Dana Angluin,et al. Local and global properties in networks of processors (Extended Abstract) , 1980, STOC '80.
[22] Silvio Lattanzi,et al. Rumour spreading and graph conductance , 2010, SODA '10.
[23] Doug Terry,et al. Epidemic algorithms for replicated database maintenance , 1988, OPSR.
[24] Noga Alon,et al. Many Random Walks Are Faster Than One , 2011, Comb. Probab. Comput..
[25] Chen Avin,et al. Efficient and robust query processing in dynamic environments using random walk techniques , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.
[26] Donald F. Towsley,et al. Locating network monitors: complexity, heuristics, and coverage , 2005, INFOCOM.
[27] Rachid Guerraoui,et al. Gossiping in a multi-channel radio network an oblivious approach to coping with malicious interference , 2007 .
[28] Devavrat Shah,et al. Computing separable functions via gossip , 2005, PODC '06.
[29] Masafumi Yamashita,et al. Computing on an anonymous network , 1988, PODC '88.
[30] Chen Avin,et al. Tight bounds for algebraic gossip on graphs , 2010, 2010 IEEE International Symposium on Information Theory.
[31] Richard M. Karp,et al. Randomized rumor spreading , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[32] Roger Wattenhofer,et al. The price of being near-sighted , 2006, SODA '06.
[33] Silvio Lattanzi,et al. Almost tight bounds for rumour spreading with conductance , 2010, STOC '10.
[34] Thomas Moscibroda,et al. What Cannot Be Computed Locally , 2004 .