Jianping Li

Affiliations:
  • Yunnan University, Kunming, China


According to our database1, Jianping Li authored at least 27 papers between 2006 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2019
Improved approximation algorithms for the combination problem of parallel machine scheduling and path.
J. Comb. Optim., 2019

On Approximations for Constructing Required Subgraphs Using Stock Pieces of Fixed Length.
Proceedings of the Algorithmic Aspects in Information and Management, 2019

2018
Approximation algorithms for constructing specific subgraphs with minimum number of length-bounded stock pieces.
Inf. Process. Lett., 2018

Semi-online Hierarchical Scheduling for Bag-of-tasks on Two Machines.
Proceedings of the 2018 2nd International Conference on Computer Science and Artificial Intelligence, 2018

2017
Approximation algorithms for constructing spanning K-trees using stock pieces of bounded length.
Optim. Lett., 2017

Approximation Algorithms for the Generalized Stacker Crane Problem.
Proceedings of the Combinatorial Optimization and Applications, 2017

The restricted minimum single source shortest path tree expansion problem.
Proceedings of the 16th IEEE/ACIS International Conference on Computer and Information Science, 2017

2016
The Prize-collecting Call Control Problem on Weighted Lines and Rings.
RAIRO Oper. Res., 2016

Approximations for constructing tree-form structures using specific material with fixed length.
Optim. Lett., 2016

2015
Penalty cost constrained identical parallel machine scheduling problem.
Theor. Comput. Sci., 2015

The Directed Ring Loading with Penalty Cost.
Proceedings of the WALCOM: Algorithms and Computation - 9th International Workshop, 2015

2014
Approximation algorithms for $k$ -partitioning problems with partition matroid constraint.
Optim. Lett., 2014

The subdivision-constrained routing requests problem.
J. Comb. Optim., 2014

Approximation algorithms for the ring loading problem with penalty cost.
Inf. Process. Lett., 2014

Approximation algorithms for constructing some required structures in digraphs.
Eur. J. Oper. Res., 2014

Approximation algorithms for solving the constrained arc routing problem in mixed graphs.
Eur. J. Oper. Res., 2014

Parallel-Machine Scheduling Problem under the Job Rejection Constraint - (Extended Abstract).
Proceedings of the Frontiers in Algorithmics - 8th International Workshop, 2014

2013
Approximations for two variants of the Steiner tree problem in the Euclidean plane $${\mathbb{R}^2}$$.
J. Glob. Optim., 2013

2012
Shortest path problems with left-side time windows.
Optim. Lett., 2012

A polynomial time approximation scheme for embedding a directed hypergraph on a weighted ring.
J. Comb. Optim., 2012

Two Approximation Schemes for Scheduling on Parallel Machines under a grade of Service Provision.
Asia Pac. J. Oper. Res., 2012

2010
An improved approximation algorithm for the maximum TSP.
Theor. Comput. Sci., 2010

2009
The subdivision-constrained minimum spanning tree problem.
Theor. Comput. Sci., 2009

An improved approximation algorithm for the ATSP with parameterized triangle inequality.
J. Algorithms, 2009

Polynomial Approximation Schemes for the Max-Min Allocation Problem under a grade of Service Provision.
Discret. Math. Algorithms Appl., 2009

2007
Some approximation algorithms for the clique partition problem in weighted interval graphs.
Theor. Comput. Sci., 2007

2006
Minimum Clique Partition Problem with Constrained Weight for Interval Graphs.
Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006


  Loading...