Gutin, Gregory and Yeo, Anders (2003) Upper bounds on ATSP neighborhood size.. Discrete Applied Mathematics, 129 (2-3).
Full text access: Open
We consider the Asymmetric Traveling Salesman Problem (ATSP) and use the definition of neighborhood by Deineko and Woeginger (see Math. Programming 87 (2000) 519–542). Let μ(n) be the maximum cardinality of polynomial time searchable neighborhood for the ATSP on n vertices. Deineko and Woeginger conjectured that μ(n)<β(n−1)! for any constant β>0 provided P≠NP. We prove that μ(n)<β(n−k)! for any fixed integer k1 and constant β>0 provided NPP/poly, which (like P≠NP) is believed to be true. We also give upper bounds for the size of an ATSP neighborhood depending on its search time.
This is a Submitted version This version's date is: 2003 This item is not peer reviewed
https://repository.royalholloway.ac.uk/items/89dbf092-d9c0-2ef6-5759-c27f965d31a3/3/
Deposited by Research Information System (atira) on 25-Jul-2012 in Royal Holloway Research Online.Last modified on 25-Jul-2012