Given an undirected graph G = (V,E) with a weight function c ∈ R , and a positive integerK, the Kth Traveling Salesman Problem (KthTSP) is to findK Hamilton cyclesH1, H2, , ..., HK such that, for any Hamilton cycle H 6∈ {H1, H2, , ..., HK}, we have c(H) ≥ c(Hi), i = 1, 2, ...,K. This problem is NP-hard even for K fixed. We prove that KthTSP is… (More)

An O(K n log[K n]) algorithm for the Kth Best Spanning Tree in Series Parallel Graphs, Arabian Journal for Science and Engineering, Arabian Journal for Science and Engineering