A note on the traveling salesman reoptimization problem under vertex insertion

Abstract We propose a 4 3 -approximation in linear time for the metric traveling salesman reoptimization problem under vertex insertion. This constitutes an improvement of the time complexity of the best known existing bound since in Ausiello et al. (2009) [5] a 4/3-approximation is already given with a complexity O ( n 3 ) . Our algorithm is of independent interest because it does not use a matching to build the approximate solution.

[1]  Leena Jain,et al.  Traveling Salesman Problem: A Case Study , 2012, BIOINFORMATICS 2012.

[2]  Dennis Komm,et al.  Reoptimization of the Shortest Common Superstring Problem , 2009, Algorithmica.

[3]  Anna Zych,et al.  New Advances in Reoptimizing the Minimum Steiner Tree Problem , 2012, MFCS.

[4]  Abraham P. Punnen,et al.  The traveling salesman problem and its variations , 2007 .

[5]  Anna Zych,et al.  Reoptimization of Weighted Graph and Covering Problems , 2008, WAOA.

[6]  N. Biggs.  THE TRAVELING SALESMAN PROBLEM A Guided Tour of Combinatorial Optimization , 1986 .

[7]  Vangelis Th. Paschos,et al.  Reoptimization of maximum weight induced hereditary subgraph problems , 2013, Theor. Comput. Sci..

[8]  Michael A. Bender,et al.  Reallocation Problems in Scheduling , 2013, Algorithmica.

[9]  Vangelis Th. Paschos,et al.  Fast reoptimization for the minimum spanning tree problem , 2010, J. Discrete Algorithms.

[10]  Bernard Chazelle,et al.  Approximating the Minimum Spanning Tree Weight in Sublinear Time , 2001, ICALP.

[11]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[12]  Vangelis Th. Paschos,et al.  Reoptimization of the Maximum Weighted P k -Free Subgraph Problem under Vertex Insertion , 2012, WALCOM.

[13]  Vangelis Th. Paschos,et al.  Simple and Fast Reoptimizations for the Steiner Tree Problem , 2009, Algorithmic Oper. Res..

[14]  Federico Della Croce,et al.  Reoptimization in machine scheduling , 2014, Theor. Comput. Sci..

[15]  Markus W. Schäffter,et al.  Scheduling with Forbidden Sets , 1997, Discret. Appl. Math..

[16]  Juraj Hromkovic,et al.  On the Hardness of Reoptimization , 2008, SOFSEM.

[17]  Hans-Joachim Böckenhauer,et al.  Approximation hardness of deadline-TSP reoptimization , 2009, Theor. Comput. Sci..

[18]  T. Neumann.  Computers And Intractability A Guide To The Theory Of Np Completeness , 2016 .

[19]  Luca Bertazzi,et al.  Reoptimizing the 0-1 knapsack problem , 2010, Discret. Appl. Math..

[20]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[21]  G. Handler.  Minimax Location of a Facility in an Undirected Tree Graph , 1973 .

[22]  Vangelis Th. Paschos,et al.  A survey on combinatorial optimization in dynamic environments , 2011, RAIRO Oper. Res..

[23]  Martin Mares,et al.  The saga of minimum spanning trees , 2008, Comput. Sci. Rev..

[24]  G. Ausiello,et al.  Complexity and Approximation in Reoptimization , 2008 .

[25]  Juraj Hromkovic,et al.  Steiner tree reoptimization in graphs with sharpened triangle inequality , 2012, J. Discrete Algorithms.

[26]  Baruch Schieber,et al.  A Theory and Algorithms for Combinatorial Reoptimization , 2012, Algorithmica.

[27]  Harald Hempel,et al.  Reoptimization of Traveling Salesperson Problems: Changing Single Edge-Weights , 2009, LATA.

[28]  Vangelis Th. Paschos,et al.  Reoptimization of minimum and maximum traveling salesman's tours , 2009, J. Discrete Algorithms.

[29]  S. Barry Cooper,et al.  Computability In Context: Computation and Logic in the Real World , 2009 .

[30]  Maria Grazia Speranza,et al.  Reoptimizing the rural postman problem , 2013, Comput. Oper. Res..

[31]  Juraj Hromkovic,et al.  Reoptimization of Steiner Trees , 2008, SWAT.

[32]  Luca Bertazzi,et al.  Reoptimizing the traveling salesman problem , 2003, Networks.

[33]  Guido Proietti,et al.  On the Approximability of TSP on Local Modifications of Optimally Solved Instances , 2007, Algorithmic Oper. Res..