Bing Su - RankMe

33 papers B 1C 3Misc 2Journal 24Unranked 3

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	An efficient polynomial-time approximation scheme for parallel multi-stage open shops. Discret. Appl. Math. Jianming Dong, Ruyan Jin, Guohui Lin, Bing Su, Weitian Tong, Yao Xu
2025	J	`jnl`	Approximation algorithms for the maximum path cover problem using long paths. Inf. Comput. Mingyang Gong, Yong Chen, Zhi-Zhong Chen, Guohui Lin, Bing Su, Lusheng Wang
2025	J	`jnl`	Improved approximation algorithms for multiprocessor indivisible coflow scheduling. J. Comb. Optim. Mingyang Gong, Guangting Chen, Guohui Lin, Bing Su
2025	J	`jnl`	Multiprocessor scheduling with testing: improved online algorithms and numerical experiments. J. Sched. Mingyang Gong, Jing Fan, Guohui Lin, Bing Su, Zihan Su, Xiang Zhang
2024	J	`jnl`	A polynomial-time approximation scheme for an arbitrary number of parallel identical multi-stage flow-shops. Ann. Oper. Res. Mingyang Gong, Guohui Lin, Eiji Miyano, Bing Su, Weitian Tong
2024	—	`conf`	Improved Approximation Algorithms for Multiprocessor Indivisible Coflow Scheduling. COCOON (1) Mingyang Gong, Guohui Lin, Bing Su
2022	J	`jnl`	A local search 4/3-approximation algorithm for the minimum 3-path partition problem. J. Comb. Optim. Yong Chen, Randy Goebel, Guohui Lin, Longcheng Liu, Bing Su, Weitian Tong, Yao Xu, An Zhang
2022	J	`jnl`	A tardiness-augmented approximation scheme for rejection-allowed multiprocessor rescheduling. J. Comb. Optim. Wenchang Luo, Rylan Chin, Alexander Cai, Guohui Lin, Bing Su, An Zhang
2022	J	`jnl`	An efficient polynomial-time approximation scheme for parallel multi-stage open shops. CoRR Jianming Dong, Ruyan Jin, Guohui Lin, Bing Su, Weitian Tong, Yao Xu
2022	J	`jnl`	Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph. J. Comb. Optim. Yong Chen, Yinhui Cai, Longcheng Liu, Guangting Chen, Randy Goebel, Guohui Lin, Bing Su, An Zhang
2021	J	`jnl`	Minimizing total job completion time in MapReduce scheduling. Comput. Ind. Eng. Jianming Dong, Randy Goebel, Jueliang Hu, Guohui Lin, Bing Su
2020	J	`jnl`	A (1.4 + ε )-approximation algorithm for the 2-Max-Duo problem. J. Comb. Optim. Yong Chen, Guohui Lin, Tian Liu, Taibo Luo, Bing Su, Yao Xu, Peng Zhang
2020	J	`jnl`	An approximation scheme for rejection-allowed single-machine rescheduling. Comput. Ind. Eng. Wenchang Luo, Miaomiao Jin, Bing Su, Guohui Lin
2020	J	`jnl`	Approximation algorithms for the three-machine proportionate mixed shop scheduling. Theor. Comput. Sci. Longcheng Liu, Yong Chen, Jianming Dong, Randy Goebel, Guohui Lin, Yue Luo, Guanqun Ni, Bing Su, Yao Xu, An Zhang
2020	J	`jnl`	Open-shop scheduling for unit jobs under precedence constraints. Theor. Comput. Sci. Yong Chen, Randy Goebel, Guohui Lin, Bing Su, An Zhang
2020	J	`jnl`	Two-stage open-shop scheduling with a two-machine flow shop as a stage: approximation algorithms and empirical experiments. J. Sched. Jianming Dong, Joshua Chang, Bing Su, Jueliang Hu, Guohui Lin
2019	B	`conf`	A 21/16-Approximation for the Minimum 3-Path Partition Problem. ISAAC Yong Chen, Randy Goebel, Bing Su, Weitian Tong, Yao Xu, An Zhang
2019	Misc	`conf`	A Local Search 4/3-approximation Algorithm for the Minimum 3-path Partition Problem. FAW Yong Chen, Randy Goebel, Guohui Lin, Longcheng Liu, Bing Su, Weitian Tong, Yao Xu, An Zhang
2019	J	`jnl`	An improved approximation algorithm for the minimum 3-path partition problem. J. Comb. Optim. Yong Chen, Randy Goebel, Guohui Lin, Bing Su, Yao Xu, An Zhang
2019	J	`jnl`	Efficient algorithms for computing one or two discrete centers hitting a set of line segments. J. Comb. Optim. Xiaozhou He, Zhihui Liu, Bing Su, Yinfeng Xu, Feifeng Zheng, Binhai Zhu
2018	J	`jnl`	A local search 4/3-approximation algorithm for the minimum 3-path partition problem. CoRR Yong Chen, Randy Goebel, Guohui Lin, Longcheng Liu, Bing Su, Weitian Tong, Yao Xu, An Zhang
2018	Misc	`conf`	An Approximation Framework for Bounded Facility Location Problems. COCOON Wenchang Luo, Bing Su, Yao Xu, Guohui Lin
2018	J	`jnl`	Approximation algorithms for the three-machine proportionate mixed shop scheduling. CoRR Longcheng Liu, Yong Chen, Jianming Dong, Randy Goebel, Guohui Lin, Yue Luo, Guanqun Ni, Bing Su, An Zhang
2018	—	`conf`	Hitting a Set of Line Segments with One or Two Discrete Centers. CCCG Xiaozhou He, Zhihui Liu, Bing Su, Yinfeng Xu, Feifeng Zheng, Binhai Zhu
2015	J	`jnl`	Minimax regret 1-sink location problem in dynamic path networks. Theor. Comput. Sci. Yuya Higashikawa, John Augustine, Siu-Wing Cheng, Mordecai J. Golin, Naoki Katoh, Guanqun Ni, Bing Su, Yin-Feng Xu
2014	J	`jnl`	A note on visibility-constrained Voronoi diagrams. Discret. Appl. Math. Franz Aurenhammer, Bing Su, Yin-Feng Xu, Binhai Zhu
2014	C	`conf`	On the Exact Block Cover Problem. AAIM Haitao Jiang, Bing Su, Mingyu Xiao, Yinfeng Xu, Farong Zhong, Binhai Zhu
2013	J	`jnl`	Baseline Bounded half-Plane Voronoi Diagram. Discret. Math. Algorithms Appl. Bing Su, Yinfeng Xu, Binhai Zhu
2013	C	`conf`	Minimax Regret 1-Sink Location Problems in Dynamic Path Networks. TAMC Siu-Wing Cheng, Yuya Higashikawa, Naoki Katoh, Guanqun Ni, Bing Su, Yinfeng Xu
2009	J	`jnl`	Finding an anti-risk path between two nodes in undirected graphs. J. Comb. Optim. Peng Xiao, Yinfeng Xu, Bing Su
2009	J	`jnl`	The canadian traveller problem and its competitive analysis. J. Comb. Optim. Yinfeng Xu, Maolin Hu, Bing Su, Binhai Zhu, Zhijun Zhu
2008	C	`conf`	A Risk-Reward Competitive Analysis for the Recoverable Canadian Traveller Problem. COCOA Bing Su, Yinfeng Xu, Peng Xiao, Lei Tian
2004	—	`conf`	Decision Making and Analysis for Unexpected Road Blockages. ICEB Bing Su, Yinfeng Xu