Tongquan Zhang

According to our database, Tongquan Zhang authored at least 6 papers between 2009 and 2012.

Collaborative distances:

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

2012

Shortest path problems with left-side time windows.

Tongquan Zhang, Ying Yin, Jianping Li

Optim. Lett., 2012

The minimum spanning tree problem with non-terminal set.

Tongquan Zhang, Ying Yin

Inf. Process. Lett., 2012

Two Approximation Schemes for Scheduling on Parallel Machines under a grade of Service Provision.

Weidong Li, Jianping Li, Tongquan Zhang

Asia Pac. J. Oper. Res., 2012

2010

An improved approximation algorithm for the maximum TSP.

Tongquan Zhang, Ying Yin, Jianping Li

Theor. Comput. Sci., 2010

2009

The subdivision-constrained minimum spanning tree problem.

Jianping Li, Weidong Li, Tongquan Zhang, Zhongxu Zhang

Theor. Comput. Sci., 2009

An improved approximation algorithm for the ATSP with parameterized triangle inequality.

Tongquan Zhang, Weidong Li, Jianping Li

J. Algorithms, 2009