Yong Chen

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 46

Top Topics

Identical Machines

Approximation Algorithms

Precedence Constraints

Top Venues

J. Comb. Optim.

Theor. Comput. Sci.

Publications

Yong Chen, Zhi-Zhong Chen, Curtis Kennedy, Guohui Lin, Yao Xu, An Zhang
Approximating the directed path partition problem. Inf. Comput. 297 (2024)
An Zhang, Liang Zhang, Yong Chen, Guangting Chen, Xing Wang
Complexity and approximation algorithms for two parallel dedicated machine scheduling with conflict constraints. Theor. Comput. Sci. 941 (2023)
An Zhang, Tan Zhen, Yong Chen, Guangting Chen
An improved algorithm for parallel machine scheduling under additional resource constraints. Optim. Lett. 17 (3) (2023)
Guangting Chen, Yong Chen, Zhi-Zhong Chen, Guohui Lin, Tian Liu, An Zhang
Approximation algorithms for the maximally balanced connected graph tripartition problem. J. Comb. Optim. 44 (3) (2022)
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) (2022)
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) (2022)
Yong Chen, Zhi-Zhong Chen, Curtis Kennedy, Guohui Lin, Yao Xu, An Zhang
Approximation Algorithms for the Directed Path Partition Problems. IJTCS-FAW (2021)
Yong Chen, Zhi-Zhong Chen, Curtis Kennedy, Guohui Lin, Yao Xu, An Zhang
Approximation algorithms for the directed path partition problems. CoRR (2021)
Yong Chen, Zhi-Zhong Chen, Guohui Lin, Lusheng Wang, An Zhang
A randomized approximation algorithm for metric triangle packing. J. Comb. Optim. 41 (1) (2021)
Yong Chen, An Zhang, Zhiyi Tan, Ying Xue, Guangting Chen
A (32+ε)-approximation algorithm for scheduling on two parallel machines with job delivery coordination. J. Oper. Res. Soc. 72 (9) (2021)
Xiaojuan Jiang, An Zhang, Yong Chen, Guangting Chen, Kangbok Lee
An improved algorithm for a two-stage production scheduling problem with an outsourcing option. Theor. Comput. Sci. 876 (2021)
Xing Wang, Guangting Chen, Yong Chen, Guohui Lin, Yonghao Wang, An Zhang
Improved hardness and approximation results for single allocation hub location problems. Theor. Comput. Sci. 864 (2021)
An Zhang, Liang Zhang, Yong Chen, Guangting Chen, Xing Wang
Approximation Algorithms for Two Parallel Dedicated Machine Scheduling with Conflict Constraints. COCOA (2021)
Qiaojun Shu, Yong Chen, Shuguang Han, Guohui Lin, Eiji Miyano, An Zhang
Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles. Theor. Comput. Sci. 882 (2021)
Yong Chen, Zhi-Zhong Chen, Guohui Lin, Yao Xu, An Zhang
Approximation Algorithms for Maximally Balanced Connected Graph Partition. Algorithmica 83 (12) (2021)
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) (2020)
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 (2020)
Yong Chen, Randy Goebel, Guohui Lin, Bing Su, An Zhang
Open-shop scheduling for unit jobs under precedence constraints. Theor. Comput. Sci. 803 (2020)
An Zhang, Yong Chen, Zhi-Zhong Chen, Guohui Lin
Improved Approximation Algorithms for Path Vertex Covers in Regular Graphs. Algorithmica 82 (10) (2020)
Qiaojun Shu, Yong Chen, Shuguang Han, Guohui Lin, Eiji Miyano, An Zhang
Acyclic Edge Coloring Conjecture Is True on Planar Graphs Without Intersecting Triangles. TAMC (2020)
Xing Wang, Guangting Chen, Yong Chen, Guohui Lin, Yonghao Wang, An Zhang
Improved Hardness and Approximation Results for Single Allocation Hub Location. AAIM (2020)
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) (2019)
Yong Chen, Zhi-Zhong Chen, Guohui Lin, Yao Xu, An Zhang
Approximation algorithms for maximally balanced connected graph partition. CoRR (2019)
Zhi-Zhong Chen, Guohui Lin, Lusheng Wang, Yong Chen, Dan Wang
Approximation Algorithms for the Maximum Weight Internal Spanning Tree Problem. Algorithmica 81 (11-12) (2019)
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)
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)
Yong Chen, Zhi-Zhong Chen, Guohui Lin, Lusheng Wang, An Zhang
A Randomized Approximation Algorithm for Metric Triangle Packing. COCOA (2019)
Yong Chen, Zhi-Zhong Chen, Guohui Lin, Yao Xu, An Zhang
Approximation Algorithms for Maximally Balanced Connected Graph Partition. COCOA (2019)
An Zhang, Yong Chen, Lin Chen, Guangting Chen
On the NP-hardness of scheduling with time restrictions. Discret. Optim. 28 (2018)
Yinhui Cai, Guangting Chen, Yong Chen, Randy Goebel, Guohui Lin, Longcheng Liu, An Zhang
Approximation Algorithms for Two-Machine Flow-Shop Scheduling with a Conflict Graph. COCOON (2018)
Yinhui Cai, Guangting Chen, Yong Chen, Randy Goebel, Guohui Lin, Longcheng Liu, An Zhang
Approximation algorithms for two-machine flow-shop scheduling with a conflict graph. CoRR (2018)
An Zhang, Yong Chen, Zhi-Zhong Chen, Guohui Lin
Improved approximation algorithms for path vertex covers in regular graphs. CoRR (2018)
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 (2018)
An Zhang, Yong Chen, Randy Goebel, Guohui Lin
Open-Shop Scheduling for Unit Jobs Under Precedence Constraints. COCOA (2018)
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 (2018)
Longcheng Liu, Guanqun Ni, Yong Chen, Randy Goebel, Yue Luo, An Zhang, Guohui Lin
Approximation Algorithms and a Hardness Result for the Three-Machine Proportionate Mixed Shop. AAIM (2018)
Zhi-Zhong Chen, Guohui Lin, Lusheng Wang, Yong Chen, Dan Wang
Approximation Algorithms for the Maximum Weight Internal Spanning Tree Problem. COCOON (2017)
Yao Xu, Yong Chen, Taibo Luo, Guohui Lin
A (1.4 + ε)-approximation algorithm for the 2-{Max-Duo} problem. CoRR (2017)
Yao Xu, Yong Chen, Taibo Luo, Guohui Lin
A local search 2.917-approximation algorithm for duo-preservation string mapping. CoRR (2017)
Yao Xu, Yong Chen, Guohui Lin, Tian Liu, Taibo Luo, Peng Zhang
A (1.4 + epsilon)-Approximation Algorithm for the 2-Max-Duo Problem. ISAAC (2017)
Guangting Chen, Lei Zhang, An Zhang, Yong Chen
Combinatorial Approximation Algorithms for Spectrum Assignment Problem in Chain and Ring Networks. COCOA (1) (2017)
An Zhang, Wenshuai Zhang, Yong Chen, Guangting Chen, Xufeng Chen
Approximate the scheduling of quay cranes with non-crossing constraints. Eur. J. Oper. Res. 258 (3) (2017)
An Zhang, Feilang Ye, Yong Chen, Guangting Chen
Better permutations for the single-processor scheduling with time restrictions. Optim. Lett. 11 (4) (2017)
An Zhang, Yong Chen, Lin Chen, Guangting Chen
On the NP-hardness of scheduling with time restrictions. CoRR (2017)
Zhi-Zhong Chen, Guohui Lin, Lusheng Wang, Yong Chen
Approximation algorithms for the maximum weight internal spanning tree problem. CoRR (2016)
An Zhang, Hongjun Wang, Yong Chen, Guangting Chen
Scheduling jobs with equal processing times and a single server on parallel identical machines. Discret. Appl. Math. 213 (2016)
Jianming Dong, An Zhang, Yong Chen, Qifan Yang
Approximation algorithms for two-machine open shop scheduling with batch and delivery coordination. Theor. Comput. Sci. 491 (2013)
Yong Chen, An Zhang, Zhiyi Tan
Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time. Inf. Sci. 251 (2013)
Yong Chen, An Zhang, Guangting Chen, Jianming Dong
Approximation algorithms for parallel open shop scheduling. Inf. Process. Lett. 113 (7) (2013)
Jianming Dong, Yong Chen, An Zhang, Qifan Yang
A new three-machine shop scheduling: complexity and approximation algorithm. J. Comb. Optim. 26 (4) (2013)
Longcheng Liu, Yong Chen, Biao Wu, Enyu Yao
Weighted Inverse Minimum Cut Problem under the Sum-Type Hamming Distance. FAW-AAIM (2012)
Zhiyi Tan, Yong Chen, An Zhang
Parallel machines scheduling with machine maintenance for minsum criteria. Eur. J. Oper. Res. 212 (2) (2011)
Yong Chen, An Zhang, Zhiyi Tan
Single Machine Scheduling with an Operator Non-availability Period to Minimize Total Completion Time. FAW-AAIM (2011)