مقالههای دارای تعهدات انتشار عمومی - Fei Chenبیشتر بدانید
جای دیگری دردسترس است: ۵
Revealing Optimal Thresholds for Generalized Secretary Problem via Continuous LP: Impacts on Online K-Item Auction and Bipartite K-Matching with Random …
THH Chan, F Chen, SHC Jiang
Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014
تعهدات: Research Grants Council, Hong Kong
Ranking on arbitrary graphs: Rematch via continuous LP with monotone and boundary condition constraints
THH Chan, F Chen, X Wu, Z Zhao
Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014
تعهدات: Research Grants Council, Hong Kong
Beating ratio 0.5 for weighted oblivious matching problems
M Abolhassani, THH Chan, F Chen, H Esfandiari, MT Hajiaghayi, ...
24th annual European symposium on algorithms (ESA 2016), 2016
تعهدات: Swedish Research Council, Research Grants Council, Hong Kong
Double auction for resource allocation in cloud computing
Z Zhao, F Chen, HTH Chan, C Wu
International Conference on Cloud Computing and Services Science, CLOSER 2017, 2017
تعهدات: Research Grants Council, Hong Kong
Analyzing node-weighted oblivious matching problem via continuous LP with jump discontinuity
THH Chan, F Chen, X Wu
ACM Transactions on Algorithms (TALG) 14 (2), 1-25, 2018
تعهدات: Research Grants Council, Hong Kong
اطلاعات انتشارات و تأمین بودجه بهطورخودکار توسط برنامه رایانهای تعیین میشود.