Affiliation:
1. Department of Mathematics and Statistics, Al Imam Mohammad Ibn Saud Islamic University (IMSIU), P. O. Box 90950, Riyadh 11623, Saudi Arabia
Abstract
Given an undirected graph [Formula: see text] with a weight function [Formula: see text], and a positive integer [Formula: see text], the Kth Traveling Salesman Problem (Kth TSP) is to find [Formula: see text] Hamilton cycles [Formula: see text] such that, for any Hamilton cycle [Formula: see text], we have [Formula: see text]. This problem is NP-hard even for [Formula: see text] fixed. We prove that Kth TSP is pseudopolynomial when TSP is polynomial.
Publisher
World Scientific Pub Co Pte Lt
Subject
Discrete Mathematics and Combinatorics