2 citations · 3 across the 2 of their papers we have counts for
3 papers
cs.GT2021★ 1 cited
Estimating the Nash Social Welfare for coverage and other submodular valuations
Wenzheng Li, Jan Vondrak
We study the Nash Social Welfare problem: Given agents with valuation functions , partition into so as to maximize $…
cs.DS2020
A polynomial lower bound on adaptive complexity of submodular maximization
Wenzheng Li, Paul Liu, Jan Vondrak
In large-data applications, it is desirable to design algorithms with a high degree of parallelization. In the context of submodular optimization, adaptive complexity has become a…
cs.DC2017★ 2 cited
The Energy Complexity of Broadcast
Yi-Jun Chang, Varsha Dani, Thomas P. Hayes +3
Energy is often the most constrained resource in networks of battery-powered devices, and as devices become smaller, they spend a larger fraction of their energy on communication (…