default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBing Su 0002
Person information
- affiliation: Xi'an Technological University, School of Economics and Management, China
Other persons with the same name
- Bing Su — disambiguation page
- Bing Su 0001
![[0000-0001-8560-1910]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0000-0001-8560-1910")
— Renmin University of China, Beijing, China (and 2 more) - Bing Su 0003 — Hong Kong Polytechnic University, Department of Building Services Engineering, Hong Kong
- Bing Su 0004 — Beihang University, School of Computer Science and Engineering, Beijing, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j21]Jianming Dong, Ruyan Jin, Guohui Lin, Bing Su, Weitian Tong, Yao Xu:
An efficient polynomial-time approximation scheme for parallel multi-stage open shops. Discret. Appl. Math. 377: 390-401 (2025)- [j20]Mingyang Gong, Yong Chen, Zhi-Zhong Chen, Guohui Lin, Bing Su, Lusheng Wang:
Approximation algorithms for the maximum path cover problem using long paths. Inf. Comput. 307: 105378 (2025) - [j19]Mingyang Gong, Guangting Chen, Guohui Lin, Bing Su:
Improved approximation algorithms for multiprocessor indivisible coflow scheduling. J. Comb. Optim. 49(5): 79 (2025) - [j18]Mingyang Gong, Jing Fan, Guohui Lin, Bing Su, Zihan Su, Xiang Zhang:
Multiprocessor scheduling with testing: improved online algorithms and numerical experiments. J. Sched. 28(5): 513-527 (2025) - 2024
- [j17]Mingyang Gong, Guohui Lin, Eiji Miyano, Bing Su, Weitian Tong:
A polynomial-time approximation scheme for an arbitrary number of parallel identical multi-stage flow-shops. Ann. Oper. Res. 335(1): 185-204 (2024) - [c9]Mingyang Gong, Guohui Lin, Bing Su:
Improved Approximation Algorithms for Multiprocessor Indivisible Coflow Scheduling. COCOON (1) 2024: 190-202 - 2022
- [j16]Yong Chen, Yinhui Cai, Longcheng Liu, Guangting Chen, Randy Goebel, Guohui Lin, Bing Su, An Zhang:
Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph. J. Comb. Optim. 43(3): 571-588 (2022) - [j15]Wenchang Luo, Rylan Chin, Alexander Cai, Guohui Lin, Bing Su, An Zhang:
A tardiness-augmented approximation scheme for rejection-allowed multiprocessor rescheduling. J. Comb. Optim. 44(1): 690-722 (2022) - [j14]Yong Chen, Randy Goebel, Guohui Lin, Longcheng Liu, Bing Su, Weitian Tong, Yao Xu, An Zhang:
A local search 4/3-approximation algorithm for the minimum 3-path partition problem. J. Comb. Optim. 44(5): 3595-3610 (2022) - [i3]Jianming Dong, Ruyan Jin, Guohui Lin, Bing Su, Weitian Tong, Yao Xu:
An efficient polynomial-time approximation scheme for parallel multi-stage open shops. CoRR abs/2205.14407 (2022) - 2021
- [j13]Jianming Dong, Randy Goebel, Jueliang Hu, Guohui Lin, Bing Su:
Minimizing total job completion time in MapReduce scheduling. Comput. Ind. Eng. 158: 107387 (2021) - 2020
- [j12]Wenchang Luo, Miaomiao Jin, Bing Su, Guohui Lin:
An approximation scheme for rejection-allowed single-machine rescheduling. Comput. Ind. Eng. 146: 106574 (2020) - [j11]Yong Chen, Guohui Lin, Tian Liu, Taibo Luo, Bing Su, Yao Xu, Peng Zhang:
A (1.4 + ε )-approximation algorithm for the 2-Max-Duo problem. J. Comb. Optim. 40(3): 806-824 (2020) - [j10]Jianming Dong, Joshua Chang, Bing Su, Jueliang Hu, Guohui Lin:
Two-stage open-shop scheduling with a two-machine flow shop as a stage: approximation algorithms and empirical experiments. J. Sched. 23(5): 595-608 (2020) - [j9]Longcheng Liu, Yong Chen, Jianming Dong, Randy Goebel, Guohui Lin, Yue Luo, Guanqun Ni, Bing Su, Yao Xu, An Zhang:
Approximation algorithms for the three-machine proportionate mixed shop scheduling. Theor. Comput. Sci. 803: 57-70 (2020) - [j8]Yong Chen, Randy Goebel, Guohui Lin, Bing Su, An Zhang:
Open-shop scheduling for unit jobs under precedence constraints. Theor. Comput. Sci. 803: 144-151 (2020)
2010 – 2019
- 2019
- [j7]Xiaozhou He, Zhihui Liu, Bing Su, Yinfeng Xu, Feifeng Zheng, Binhai Zhu:
Efficient algorithms for computing one or two discrete centers hitting a set of line segments. J. Comb. Optim. 37(4): 1408-1423 (2019) - [j6]Yong Chen, Randy Goebel, Guohui Lin, Bing Su, Yao Xu, An Zhang:
An improved approximation algorithm for the minimum 3-path partition problem. J. Comb. Optim. 38(1): 150-164 (2019) - [c8]Yong Chen, Randy Goebel, Guohui Lin, Longcheng Liu, Bing Su, Weitian Tong, Yao Xu, An Zhang:
A Local Search 4/3-approximation Algorithm for the Minimum 3-path Partition Problem. FAW 2019: 14-25 - [c7]Yong Chen, Randy Goebel, Bing Su, Weitian Tong, Yao Xu, An Zhang:
A 21/16-Approximation for the Minimum 3-Path Partition Problem. ISAAC 2019: 46:1-46:20 - 2018
- [c6]Xiaozhou He, Zhihui Liu, Bing Su, Yinfeng Xu, Feifeng Zheng, Binhai Zhu:
Hitting a Set of Line Segments with One or Two Discrete Centers. CCCG 2018: 85-90 - [c5]Wenchang Luo, Bing Su, Yao Xu, Guohui Lin:
An Approximation Framework for Bounded Facility Location Problems. COCOON 2018: 353-364 - [i2]Longcheng Liu, Yong Chen, Jianming Dong, Randy Goebel, Guohui Lin, Yue Luo, Guanqun Ni, Bing Su, An Zhang:
Approximation algorithms for the three-machine proportionate mixed shop scheduling. CoRR abs/1809.05745 (2018) - [i1]Yong Chen, Randy Goebel, Guohui Lin, Longcheng Liu, Bing Su, Weitian Tong, Yao Xu, An Zhang:
A local search 4/3-approximation algorithm for the minimum 3-path partition problem. CoRR abs/1812.09353 (2018) - 2015
- [j5]Yuya Higashikawa, John Augustine, Siu-Wing Cheng, Mordecai J. Golin, Naoki Katoh, Guanqun Ni, Bing Su, Yin-Feng Xu:
Minimax regret 1-sink location problem in dynamic path networks. Theor. Comput. Sci. 588: 24-36 (2015) - 2014
- [j4]Franz Aurenhammer, Bing Su, Yin-Feng Xu, Binhai Zhu:
A note on visibility-constrained Voronoi diagrams. Discret. Appl. Math. 174: 52-56 (2014) - [c4]Haitao Jiang, Bing Su, Mingyu Xiao, Yinfeng Xu, Farong Zhong, Binhai Zhu:
On the Exact Block Cover Problem. AAIM 2014: 13-22 - 2013
- [j3]Bing Su, Yinfeng Xu, Binhai Zhu:
Baseline Bounded half-Plane Voronoi Diagram. Discret. Math. Algorithms Appl. 5(3) (2013) - [c3]Siu-Wing Cheng, Yuya Higashikawa, Naoki Katoh, Guanqun Ni, Bing Su, Yinfeng Xu:
Minimax Regret 1-Sink Location Problems in Dynamic Path Networks. TAMC 2013: 121-132
2000 – 2009
- 2009
- [j2]Peng Xiao, Yinfeng Xu, Bing Su:
Finding an anti-risk path between two nodes in undirected graphs. J. Comb. Optim. 17(3): 235-246 (2009) - [j1]Yinfeng Xu, Maolin Hu, Bing Su, Binhai Zhu, Zhijun Zhu:
The canadian traveller problem and its competitive analysis. J. Comb. Optim. 18(2): 195-205 (2009) - 2008
- [c2]Bing Su, Yinfeng Xu, Peng Xiao, Lei Tian:
A Risk-Reward Competitive Analysis for the Recoverable Canadian Traveller Problem. COCOA 2008: 417-426 - 2004
- [c1]Bing Su, Yinfeng Xu:
Decision Making and Analysis for Unexpected Road Blockages. ICEB 2004: 1130-1135
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-11-29 00:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
