4 citations · 4 across the 2 of their papers we have counts for
2 papers
cs.DS2013
Ranking on Arbitrary Graphs: Rematch via Continuous LP with Monotone and Boundary Condition Constraints
T-H. Hubert Chan, Fei Chen, Xiaowei Wu +1
Motivated by online advertisement and exchange settings, greedy randomized algorithms for the maximum matching problem have been studied, in which the algorithm makes (random) deci…
cs.DS2013★ 4 cited
A Primal-Dual Continuous LP Method on the Multi-choice Multi-best Secretary Problem
T-H. Hubert Chan, Fei Chen
The J-choice K-best secretary problem, also known as the (J,K)-secretary problem, is a generalization of the classical secretary problem. An algorithm for the (J,K)-secretary probl…