Xianghui Zhong

According to our database, Xianghui Zhong authored at least 11 papers between 2018 and 2023.

Collaborative distances:

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

2023

The Approximation Ratio of the <i>k</i>-Opt Heuristic for the Euclidean Traveling Salesman Problem.

Ulrich A. Brodowsky, Stefan Hougardy, Xianghui Zhong

SIAM J. Comput., August, 2023

2021

On the approximation ratio of the 3-Opt algorithm for the (1, 2)-TSP.

Xianghui Zhong

Oper. Res. Lett., 2021

Hard to solve instances of the Euclidean Traveling Salesman Problem.

Stefan Hougardy, Xianghui Zhong

Math. Program. Comput., 2021

The Approximation Ratio of the k-Opt Heuristic for the Euclidean Traveling Salesman Problem.

Ulrich A. Brodowsky, Stefan Hougardy, Xianghui Zhong

CoRR, 2021

Lower Bounds on the Integraliy Ratio of the Subtour LP for the Traveling Salesman Problem.

Xianghui Zhong

CoRR, 2021

2020

Slightly improved upper bound on the integrality ratio for the s-t Path TSP.

Xianghui Zhong

Oper. Res. Lett., 2020

The approximation ratio of the 2-Opt Heuristic for the metric Traveling Salesman Problem.

Stefan Hougardy, Fabian Zaiser, Xianghui Zhong

Oper. Res. Lett., 2020

A Small Improvement to the Upper Bound on the Integrality Ratio for the s-t Path TSP.

Xianghui Zhong

CoRR, 2020

On the Approximation Ratio of the k-Opt and Lin-Kernighan Algorithm for Metric and Graph TSP.

Xianghui Zhong

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019

On the Approximation Ratio of the k-Opt and Lin-Kernighan Algorithm for Metric TSP.

Xianghui Zhong

CoRR, 2019

2018

Probabilistic Analysis of Edge Elimination for Euclidean TSP.

Xianghui Zhong

CoRR, 2018