New algorithms for Steiner tree reoptimization

{\em Reoptimization} is a setting in which we are given an (near) optimal solution of a problem instance and a local modification that slightly changes the instance. The main goal is that of finding an (near) optimal solution of the modified instance. We investigate one of the most studied scenarios in reoptimization known as {\em Steiner tree reoptimization}. Steiner tree reoptimization is a collection of strongly NP-hard optimization problems that are defined on top of the classical Steiner tree problem and for which several constant-factor approximation algorithms have been designed in the last decade. In this paper we improve upon all these results by developing a novel technique that allows us to design {\em polynomial-time approximation schemes}. Remarkably, prior to this paper, no approximation algorithm better than recomputing a solution from scratch was known for the elusive scenario in which the cost of a single edge decreases. Our results are best possible since none of the problems addressed in this paper admits a fully polynomial-time approximation scheme, unless P=NP.

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

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

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

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

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

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

[7]  S. E. Dreyfus,et al.  The steiner problem in graphs , 1971, Networks.

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

[9]  Jens Vygen,et al.  Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm , 2017, Math. Program. Comput..

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

[11]  Fabrizio Grandoni,et al.  Steiner Tree Approximation via Iterative Randomized Rounding , 2013, JACM.

[12]  Ding-Zhu Du,et al.  The k-Steiner Ratio in Graphs , 1997, SIAM J. Comput..

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

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

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

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

[17]  Juraj Hromkovic,et al.  Knowing All Optimal Solutions Does Not Help for TSP Reoptimization , 2011, Computation, Cooperation, and Life.

[18]  Dennis Komm,et al.  Reoptimization of the metric deadline TSP , 2008, J. Discrete Algorithms.

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

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

[21]  Tobias Mömke,et al.  Robust Reoptimization of Steiner Trees , 2020, Algorithmica.

[22]  Vangelis Th. Paschos,et al.  Reoptimization under Vertex Insertion: Max PK-Free Subgraph and Max Planar Subgraph , 2013, Discret. Math. Algorithms Appl..

[23]  Juraj Hromkovic,et al.  On the Hardness of Reoptimization with Multiple Given Solutions , 2011, Fundam. Informaticae.

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

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

[26]  Juraj Hromkovic,et al.  Reoptimization of Steiner trees: Changing the terminal set , 2009, Theor. Comput. Sci..

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

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

[29]  Jérôme Monnot,et al.  A note on the traveling salesman reoptimization problem under vertex insertion , 2015, Inf. Process. Lett..

[30]  Wenkai Dai.  Reoptimization of Minimum Latency Problem , 2017, COCOON.

[31]  Anna Zych-Pawlewicz,et al.  Reoptimization of NP-Hard Problems , 2018, Adventures Between Lower Bounds and Higher Altitudes.

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

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

[34]  Anna Zych,et al.  New Reoptimization Techniques applied to Steiner Tree Problem , 2011, Electron. Notes Discret. Math..