Jian Sun

Orcid: 0000-0003-4205-9513

Affiliations:
  • Nankai University, Center for Combinatorics, Tianjin, China
  • Beijing University of Technology, Department of Operations Research and Information Engineering, Beijing, China
  • Nanjing Normal University, School of Mathematical Science and Institute of Mathematics, Nanjing, China


According to our database1, Jian Sun authored at least 12 papers between 2019 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
An approximation algorithm for high-dimensional table compression on balanced K-partite graph.
Comput. Electr. Eng., January, 2024

2023
A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis.
J. Glob. Optim., November, 2023

An LP-based approximation algorithm for the generalized traveling salesman path problem.
Theor. Comput. Sci., 2023

2022
Randomized selection algorithm for online stochastic unrelated machines scheduling.
J. Comb. Optim., 2022

Approximation algorithms with constant ratio for general cluster routing problems.
J. Comb. Optim., 2022

Approximation algorithms for stochastic set cover and single sink rent-or-buy with submodular penalty.
J. Comb. Optim., 2022

2021
A LP-based Approximation Algorithm for generalized Traveling Salesperson Path Problem.
Proceedings of the Combinatorial Optimization and Applications, 2021

2020
Randomized mechanism design for decentralized network scheduling.
Optim. Methods Softw., 2020

Approximation Algorithms for General Cluster Routing Problem.
Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

Approximation Algorithm for Stochastic Set Cover Problem.
Proceedings of the Algorithmic Aspects in Information and Management, 2020

2019
Scheduling Three Identical Parallel Machines with Capacity Constraints.
Proceedings of the Optimization of Complex Systems: Theory, 2019

Approximation Algorithm for Stochastic Prize-Collecting Steiner Tree Problem.
Proceedings of the Algorithmic Aspects in Information and Management, 2019


  Loading...