2 citations · 6 across the 5 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2020★ 2 cited
Submodular Maximization in Clean Linear Time
Wenxin Li, Moran Feldman, Ehsan Kazemi +1
In this paper, we provide the first deterministic algorithm that achieves the tight approximation guarantee for submodular maximization under a cardinality (size) constrain…
cs.DS2019★ 2 cited
A Faster FPTAS for Knapsack Problem With Cardinality Constraint
Wenxin Li, Joohyun Lee
We study the -item knapsack problem (i.e., -dimensional KP), which is a generalization of the famous 0-1 knapsack problem (i.e., -dimensional KP) in which an upper bound…
cs.DS2018★ 1 cited
Nearly Linear Time Deterministic Algorithms for Submodular Maximization Under Knapsack Constraint and Beyond
Wenxin Li
In this work, we study the classic submodular maximization problem under knapsack constraints and beyond. We first present an -approximate algorithm for single…