4 citations · 9 across the 10 of their papers we have counts for
Showing 2025Show all
3 papers · 1 filter
cs.DS2025
Weakly Approximating Knapsack in Subquadratic Time
Lin Chen, Jiayi Lian, Yuchen Mao +1
We consider the classic Knapsack problem. Let and be the capacity and the optimal value, respectively. If one seeks a solution with total profit at least $\mathr…
stat.AP2025
Bridging the Data Gap in AI Reliability Research and Establishing DR-AIR, a Comprehensive Data Repository for AI Reliability
Simin Zheng, Jared M. Clark, Fatemeh Salboukh +10
Artificial intelligence (AI) technology and systems have been advancing rapidly. However, ensuring the reliability of these systems is crucial for fostering public confidence in th…
cs.DS2025
Approximating Partition in Deterministic Near-Linear Time
Lin Chen, Jiayi Lian, Yuchen Mao +1
We propose a deterministic -time FPTAS (Fully Polynomial-Time Approximation Scheme) for the classical Partition problem. This is the best possible (up…