Ke Shi

collaborators

2 papers

cs.DS2024

An Optimal Algorithm for the Stacker Crane Problem on Fixed Topologies

Yike Chen, Ke Shi, Chao Xu

The Stacker Crane Problem (SCP) is a variant of the Traveling Salesman Problem. In SCP, pairs of pickup and delivery points are designated on a graph, and a crane must visit these…

cs.DM2022

Almost optimum $ℓ$ -covering of $Z_{n}$

Ke Shi, Chao Xu

A subset $B$ of the ring $Z_{n}$ is referred to as a $ℓ$ -covering set if ${ab (mod n) ∣0 \leq a \leq ℓ, b \in B} = Z_{n}$ . We show that there exists a $ℓ$ -…

An Optimal Algorithm for the Stacker Crane Problem on Fixed Topologies

Almost optimum ℓ-covering of Zn​

Almost optimum $ℓ$ -covering of $Z_{n}$