Bing Su

According to our database, Bing Su authored at least 28 papers between 2004 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Improved approximation algorithms for multiprocessor indivisible coflow scheduling.

Mingyang Gong, Guangting Chen, Guohui Lin, Bing Su

J. Comb. Optim., July, 2025

2024

A polynomial-time approximation scheme for an arbitrary number of parallel identical multi-stage flow-shops.

Mingyang Gong, Guohui Lin, Eiji Miyano, Bing Su, Weitian Tong

Ann. Oper. Res., April, 2024

Improved Approximation Algorithms for Multiprocessor Indivisible Coflow Scheduling.

Mingyang Gong, Guohui Lin, Bing Su

Proceedings of the Computing and Combinatorics - 30th International Conference, 2024

2022

A tardiness-augmented approximation scheme for rejection-allowed multiprocessor rescheduling.

Wenchang Luo, Rylan Chin, Alexander Cai, Guohui Lin, Bing Su, An Zhang

J. Comb. Optim., 2022

A local search 4/3-approximation algorithm for the minimum 3-path partition problem.

Yong Chen, Randy Goebel, Guohui Lin, Longcheng Liu, Bing Su, Weitian Tong, Yao Xu, An Zhang

J. Comb. Optim., 2022

Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph.

Yong Chen, Yinhui Cai, Longcheng Liu, Guangting Chen, Randy Goebel, Guohui Lin, Bing Su, An Zhang

J. Comb. Optim., 2022

An efficient polynomial-time approximation scheme for parallel multi-stage open shops.

Jianming Dong, Ruyan Jin, Guohui Lin, Bing Su, Weitian Tong, Yao Xu

CoRR, 2022

2021

Minimizing total job completion time in MapReduce scheduling.

Jianming Dong, Randy Goebel, Jueliang Hu, Guohui Lin, Bing Su

Comput. Ind. Eng., 2021

2020

Approximation algorithms for the three-machine proportionate mixed shop scheduling.

Longcheng Liu, Yong Chen, Jianming Dong, Randy Goebel, Guohui Lin, Yue Luo, Guanqun Ni, Bing Su, Yao Xu, An Zhang

Theor. Comput. Sci., 2020

Open-shop scheduling for unit jobs under precedence constraints.

Yong Chen, Randy Goebel, Guohui Lin, Bing Su, An Zhang

Theor. Comput. Sci., 2020

Two-stage open-shop scheduling with a two-machine flow shop as a stage: approximation algorithms and empirical experiments.

Jianming Dong, Joshua Chang, Bing Su, Jueliang Hu, Guohui Lin

J. Sched., 2020

A (1.4 + ε )-approximation algorithm for the 2-Max-Duo problem.

Yong Chen, Guohui Lin, Tian Liu, Taibo Luo, Bing Su, Yao Xu, Peng Zhang

J. Comb. Optim., 2020

An approximation scheme for rejection-allowed single-machine rescheduling.

Wenchang Luo, Miaomiao Jin, Bing Su, Guohui Lin

Comput. Ind. Eng., 2020

2019

Efficient algorithms for computing one or two discrete centers hitting a set of line segments.

Xiaozhou He, Zhihui Liu, Bing Su, Yinfeng Xu, Feifeng Zheng, Binhai Zhu

J. Comb. Optim., 2019

An improved approximation algorithm for the minimum 3-path partition problem.

Yong Chen, Randy Goebel, Guohui Lin, Bing Su, Yao Xu, An Zhang

J. Comb. Optim., 2019

A 21/16-Approximation for the Minimum 3-Path Partition Problem.

Yong Chen, Randy Goebel, Bing Su, Weitian Tong, Yao Xu, An Zhang

Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

2018

Approximation algorithms for the three-machine proportionate mixed shop scheduling.

Longcheng Liu, Yong Chen, Jianming Dong, Randy Goebel, Guohui Lin, Yue Luo, Guanqun Ni, Bing Su, An Zhang

CoRR, 2018

An Approximation Framework for Bounded Facility Location Problems.

Wenchang Luo, Bing Su, Yao Xu, Guohui Lin

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

Hitting a Set of Line Segments with One or Two Discrete Centers.

Xiaozhou He, Zhihui Liu, Bing Su, Yinfeng Xu, Feifeng Zheng, Binhai Zhu

Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

2015

Minimax regret 1-sink location problem in dynamic path networks.

Yuya Higashikawa, John Augustine, Siu-Wing Cheng, Mordecai J. Golin, Naoki Katoh, Guanqun Ni, Bing Su, Yin-Feng Xu

Theor. Comput. Sci., 2015

2014

A note on visibility-constrained Voronoi diagrams.

Franz Aurenhammer, Bing Su, Yin-Feng Xu, Binhai Zhu

Discret. Appl. Math., 2014

On the Exact Block Cover Problem.

Haitao Jiang, Bing Su, Mingyu Xiao, Yinfeng Xu, Farong Zhong, Binhai Zhu

Proceedings of the Algorithmic Aspects in Information and Management, 2014

2013

Baseline Bounded half-Plane Voronoi Diagram.

Bing Su, Yinfeng Xu, Binhai Zhu

Discret. Math. Algorithms Appl., 2013

Minimax Regret 1-Sink Location Problems in Dynamic Path Networks.

Siu-Wing Cheng, Yuya Higashikawa, Naoki Katoh, Guanqun Ni, Bing Su, Yinfeng Xu

Proceedings of the Theory and Applications of Models of Computation, 2013

2009

The canadian traveller problem and its competitive analysis.

Yinfeng Xu, Maolin Hu, Bing Su, Binhai Zhu, Zhijun Zhu

J. Comb. Optim., 2009

Finding an anti-risk path between two nodes in undirected graphs.

Peng Xiao, Yinfeng Xu, Bing Su

J. Comb. Optim., 2009

2008

A Risk-Reward Competitive Analysis for the Recoverable Canadian Traveller Problem.

Bing Su, Yinfeng Xu, Peng Xiao, Lei Tian

Proceedings of the Combinatorial Optimization and Applications, 2008

2004

Decision Making and Analysis for Unexpected Road Blockages.

Bing Su, Yinfeng Xu

Proceedings of the Fourth International Conference on Electronic Business, 2004