VLDB 2026 Research / reviewers in the wild / expert

Wenxin Li 0004

dblp:22/2010-4 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
1since 2021 · last 2022
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 2 · 2 first-author · 1 since 2021Computer networks · 1 · 1 first-author
YearPublicationVenuePosition
2022 A faster FPTAS for knapsack problem with cardinality constraint
Wenxin Li 0004, Ness Shroff
 Discret. Appl. Math.1
2020 On the Asymptotic Optimality of Work-Conserving Disciplines in Completion Time Minimization
abstract
In this paper, we prove that under mild stochastic assumptions, work-conserving disciplines are asymptotic optimal for minimizing total completion time. As a byproduct of our analysis, we obtain tight upper bound on the competitive ratios of work-conserving disciplines on minimizing the metric of flow time.
Wenxin Li 0004, Ness Shroff
 ICCCN1
2020 A Faster FPTAS for Knapsack Problem with Cardinality Constraint
Wenxin Li 0004, Ness Shroff
 WAOA1