default search action
Benwei Wu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j3]Benwei Wu
, Kai Han, Enpei Zhang:
On the task assignment with group fairness for spatial crowdsourcing. Inf. Process. Manag. 60(2): 103175 (2023) - 2022
- [c7]Enpei Zhang, Kai Han, Benwei Wu:
An Algorithmic View of Streaming Submodular Data Summarization with A Knapsack Constraint. DSIT 2022: 1-6 - [c6]Benwei Wu
Fast Algorithm for Big Data Summarization with Knapsack and Partition Matroid Constraints. INISTA 2022: 1-6 - 2021
- [j2]Kai Han, Shuang Cui
Approximation Algorithms for Submodular Data Summarization with a Knapsack Constraint. Proc. ACM Meas. Anal. Comput. Syst. 5(1): 05:1-05:31 (2021) - [c5]Tianshuai Zhu, Kai Han, Enpei Zhang, Benwei Wu:
A Dynamic Algorithm for Submodular Maximization with a Knapsack Constraint. HPCC/DSS/SmartCity/DependSys 2021: 462-469 - [c4]Shuang Cui, Kai Han, Tianshuai Zhu, Jing Tang, Benwei Wu, He Huang:
Randomized Algorithms for Submodular Function Maximization with a k-System Constraint. ICML 2021: 2222-2232 - [c3]Kai Han, Shuang Cui
Approximation Algorithms for Submodular Data Summarization with a Knapsack Constraint. SIGMETRICS (Abstracts) 2021: 65-66 - [c2]Kai Han, Benwei Wu, Jing Tang
Efficient and Effective Algorithms for Revenue Maximization in Social Advertising. SIGMOD Conference 2021: 671-684 - [i3]Kai Han, Shuang Cui, Tianshuai Zhu, Jing Tang, Benwei Wu, He Huang:
The Power of Randomization: Efficient and Effective Algorithms for Constrained Submodular Maximization. CoRR abs/2106.07116 (2021) - [i2]Kai Han, Benwei Wu, Jing Tang, Shuang Cui, Çigdem Aslay, Laks V. S. Lakshmanan:
Efficient and Effective Algorithms for Revenue Maximization in Social Advertising. CoRR abs/2107.04997 (2021) - 2020
- [j1]Sen Kuang
A Fusion Measurement Approach to Improve Quantum State Tomography Efficiency and Accuracy. IEEE Trans. Instrum. Meas. 69(6): 3049-3060 (2020) - [c1]Kai Han, Zongmai Cao, Shuang Cui, Benwei Wu:
Deterministic Approximation for Submodular Maximization over a Matroid in Nearly Linear Time. NeurIPS 2020 - [i1]Kai Han, Zongmai Cao, Shuang Cui, Benwei Wu:
Deterministic Approximation for Submodular Maximization over a Matroid in Nearly Linear Time. CoRR abs/2010.11420 (2020)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: