4 citations · 13 across the 6 of their papers we have counts for
9 papers
Integrated Learning and Robust Optimization
Cheng Tan, Yuchen Mao, Shuming Wang +1
Many operational decisions require solving a linear program whose cost vector is unknown at decision time and must be predicted from contextual information. Because prediction and…
Initial data gluing in the asymptotically flat regime via solution operators with prescribed support properties
Yuchen Mao, Sung-Jin Oh, Zhongkai Tao
We give new proofs of general relativistic initial data gluing results on unit-scale annuli based on explicit solution operators for the linearized constraint equation around the f…
A Nearly Quadratic-Time FPTAS for Knapsack
Lin Chen, Jiayi Lian, Yuchen Mao +1
We investigate the classic Knapsack problem and propose a fully polynomial-time approximation scheme (FPTAS) that runs in time. This improves…
Faster Algorithms for Bounded Knapsack and Bounded Subset Sum Via Fine-Grained Proximity Results
Lin Chen, Jiayi Lian, Yuchen Mao +1
We investigate pseudopolynomial-time algorithms for Bounded Knapsack and Bounded Subset Sum. Recent years have seen a growing interest in settling their fine-grained complexity wit…
Localized initial data for Einstein equations
Yuchen Mao, Zhongkai Tao
We apply a new method with explicit solution operators to construct asymptotically flat initial data sets of the vacuum Einstein equation with new localization properties. Applicat…
Restricted Max-Min Allocation: Approximation and Integrality Gap
Siu-Wing Cheng, Yuchen Mao
Asadpour, Feige, and Saberi proved that the integrality gap of the configuration LP for the restricted max-min allocation problem is at most . However, their proof does not give…
The diophantine exponent of the points of
Mostafa W. Hassan, Yuchen Mao, Naser T. Sardari +2
Assume a polynomial-time algorithm for factoring integers, Conjecture~\ref{conj}, and and are prime numbers, where for some . We develop a polyn…
Integrality Gap of the Configuration LP for the Restricted Max-Min Fair Allocation
Siu-Wing Cheng, Yuchen Mao
The max-min fair allocation problem seeks an allocation of resources to players that maximizes the minimum total value obtained by any player. Each player has a non-negative va…
Restricted Max-Min Fair Allocation
Siu-Wing Cheng, Yuchen Mao
The restricted max-min fair allocation problem seeks an allocation of resources to players that maximizes the minimum total value obtained by any player. It is NP-hard to approxima…