24 citations · 86 across the 22 of their papers we have counts for
5 papers · 1 filter
Adaptive Greedy versus Non-adaptive Greedy for Influence Maximization
Wei Chen, Binghui Peng, Grant Schoenebeck +1
We consider the *adaptive influence maximization problem*: given a network and a budget , iteratively select seeds in the network to maximize the expected number of adopters…
On Adaptivity Gaps of Influence Maximization under the Independent Cascade Model with Full Adoption Feedback
Wei Chen, Binghui Peng
In this paper, we study the adaptivity gap of the influence maximization problem under independent cascade model when full-adoption feedback is available. Our main results are to d…
Adaptive Influence Maximization with Myopic Feedback
Binghui Peng, Wei Chen
We study the adaptive influence maximization problem with myopic feedback under the independent cascade model: one sequentially selects k nodes as seeds one by one from a social ne…
Stochastic Online Metric Matching
Anupam Gupta, Guru Guruganesh, Binghui Peng +1
We study the minimum-cost metric perfect matching problem under online i.i.d arrivals. We are given a fixed metric with a server at each of the points, and then requests arrive onl…
Tight Bounds for Online Edge Coloring
Ilan Reuven Cohen, Binghui Peng, David Wajc
Vizing's celebrated theorem asserts that any graph of maximum degree admits an edge coloring using at most colors. In contrast, Bar-Noy, Naor and Motwani showed over a qu…