Partial inverse maximum spanning tree in which weight can only be decreased under $$l_p$$lp-norm

The maximum or minimum spanning tree problem is a classical combinatorial optimization problem. In this paper, we consider the partial inverse maximum spanning tree problem in which the weight function can only be decreased. Given a graph, an acyclic edge set, and an edge weight function, the goal of this problem is to decrease weights as little as possible such that there exists with respect to function containing the given edge set. If the given edge set has at least two edges, we show that this problem is APX-Hard. If the given edge set contains only one edge, we present a polynomial time algorithm.

[1]  J. A. Bondy,et al.  Graph Theory , 2008, Graduate Texts in Mathematics.

[2]  James B. Orlin,et al.  Max flows in O(nm) time, or better , 2013, STOC '13.

[3]  Panos M. Pardalos,et al.  Inverse Max + Sum spanning tree problem by modifying the sum-cost vector under weighted $$l_\infty $$l∞ Norm , 2015, J. Glob. Optim..

[4]  Xiaoguang Yang,et al.  Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems , 2007, Comput. Optim. Appl..

[5]  Hong-Jian Lai,et al.  Algorithm for constraint partial inverse matroid problem with weight increase forbidden , 2016, Theor. Comput. Sci..

[6]  Xiaoguang Yang,et al.  Complexity of Partial Inverse Assignment Problem and Partial Inverse Cut Problem , 2001, RAIRO Oper. Res..

[7]  Mauro Dell'Amico,et al.  The Base-matroid and Inverse Combinatorial Optimization Problems , 2003, Discret. Appl. Math..

[8]  Hong-Jian Lai,et al.  Algorithms for the partial inverse matroid problem in which weights can only be increased , 2016, J. Glob. Optim..

[9]  Philippe L. Toint,et al.  On an instance of the inverse shortest paths problem , 1992, Math. Program..

[10]  Xiaoguang Yang,et al.  Partial inverse assignment problems under l1 norm , 2007, Oper. Res. Lett..

[11]  Clemens Heuberger,et al.  Inverse Combinatorial Optimization: A Survey on Problems, Methods, and Results , 2004, J. Comb. Optim..

[12]  Xiaoguang Yang,et al.  The partial inverse minimum spanning tree problem when weight increase is forbidden , 2008, Eur. J. Oper. Res..

[13]  Ravindra K. Ahuja,et al.  Inverse Optimization , 2001, Oper. Res..

[14]  Kurt Mehlhorn,et al.  An o(n³)-Time Algorithm Maximum-Flow Algorithm , 1996, SIAM J. Comput..

[15]  Elisabeth Gassner.  The partial inverse minimum cut problem with L 1-norm is strongly NP-hard , 2010, RAIRO Oper. Res..

[16]  Mihalis Yannakakis,et al.  The Complexity of Multiterminal Cuts , 1994, SIAM J. Comput..