Journal of Global Optimization

, Volume 69, Issue 4, pp 911–925 | Cite as

Inverse max \(+\) sum spanning tree problem under Hamming distance by modifying the sum-cost vector

  • Xiucui Guan
  • Xinyan He
  • Panos M. Pardalos
  • Binwu Zhang
Article

Abstract

The inverse max \(+\) sum spanning tree (MSST) problem is considered by modifying the sum-cost vector under the Hamming Distance. On an undirected network G(VEwc), a weight w(e) and a cost c(e) are prescribed for each edge \(e\in E\). The MSST problem is to find a spanning tree \(T^*\) which makes the combined weight \(\max _{e\in T}w(e)+\sum _{e\in T}c(e)\) as small as possible. It can be solved in \(O(m\log n)\) time, where \(m:=|E|\) and \(n:=|V|\). Whereas, in an inverse MSST problem, a given spanning tree \(T_0\) of G is not an optimal MSST. The sum-cost vector c is to be modified to \(\bar{c}\) so that \(T_0\) becomes an optimal MSST of the new network \(G(V,E,w,\bar{c})\) and the cost \(\Vert \bar{c}-c\Vert \) can be minimized under Hamming Distance. First, we present a mathematical model for the inverse MSST problem and a method to check the feasibility. Then, under the weighted bottleneck-type Hamming distance, we design a binary search algorithm whose time complexity is \(O(m log^2 n)\). Next, under the unit sum-type Hamming distance, which is also called \(l_0\) norm, we show that the inverse MSST problem (denoted by IMSST\(_0\)) is \(NP-\)hard. Assuming \({\textit{NP}} \nsubseteq {\textit{DTIME}}(m^{{\textit{poly}} \log m})\), the problem IMSST\(_0\) is not approximable within a factor of \(2^{\log ^{1-\varepsilon } m}\), for any \(\varepsilon >0\). Finally, We consider the augmented problem of IMSST\(_0\) (denoted by AIMSST\(_0\)), whose objective function is to multiply the \(l_0\) norm \(\Vert \beta \Vert _0\) by a sufficiently large number M plus the \(l_1\) norm \(\Vert \beta \Vert _1\). We show that the augmented problem and the \(l_1\) norm problem have the same Lagrange dual problems. Therefore, the \(l_1\) norm problem is the best convex relaxation (in terms of Lagrangian duality) of the augmented problem AIMSST\(_0\), which has the same optimal solution as that of the inverse problem IMSST\(_0\).

Keywords

Max \(+\) sum spanning tree problem Inverse optimization problem Hamming distance \(l_0\) norm Approximability 

Notes

Acknowledgements

Work of P.M. Pardalos was conducted at the National Research University Higher School of Economics and supported by RSF grant 14-41-00039.

References

  1. 1.
    Ahuja, R.K., Orlin, J.B.: A faster algorithm for the inverse spanning tree problem. J. Algorithms 34, 177–193 (2000)CrossRefMATHMathSciNetGoogle Scholar
  2. 2.
    Amaldi, E., Kann, V.: On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems. Theor. Comput. Sci. 209(1), 237–260 (1998)CrossRefMATHMathSciNetGoogle Scholar
  3. 3.
    Duin, C.W., Volgenant, A.: Minimum deviation and balanced optimization: a unified approach. Oper. Res. Lett. 10, 43–48 (1991)CrossRefMATHMathSciNetGoogle Scholar
  4. 4.
    Duin, C.W., Volgenant, A.: Some inverse optimization problems under the Hamming distance. Eur. J. Oper. Res. 170, 887–899 (2006)CrossRefMATHMathSciNetGoogle Scholar
  5. 5.
    Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, San Francisco (1979)MATHGoogle Scholar
  6. 6.
    Guan, X.C., Zhang, J.Z.: Inverse constrained bottleneck problems under weighted \(l_\infty \) norm. Comput. Oper. Res. 34, 3243–3254 (2007)CrossRefMATHMathSciNetGoogle Scholar
  7. 7.
    Guan, X.C., Pardalos, P.M., Zuo, X.: Inverse Max \(+\) Sum spanning tree problem by modifying the sum-cost vector under weighted \(l_\infty \) Norm. J. Glob. Optim. 61(1), 165–182 (2015)CrossRefMATHMathSciNetGoogle Scholar
  8. 8.
    Guan, X.C., Pardalos, P.M., Zhang, B.W.: Inverse Max \(+\) Sum spanning tree problem by modifying the sum-cost vector under weighted \(l_1\) norm. Optim. Lett. (2017). doi: 10.1007/s11590-017-1165-2
  9. 9.
    Guan, X.C., Zhang, B.W.: Inverse 1-median problem on trees under weighted Hamming distance. J. Glob. Optim. 54(1), 75–82 (2012)CrossRefMATHMathSciNetGoogle Scholar
  10. 10.
    He, Y., Zhang, B.W., Yao, E.Y.: Weighted inverse minimum spanning tree problems under Hamming distance. J. Comb. Optim. 9, 91–100 (2005)CrossRefMATHMathSciNetGoogle Scholar
  11. 11.
    Heuburger, C.: Inverse optimization: a survey on problems, methods, and results. J. Comb. Optim. 8(3), 329–361 (2004)CrossRefMathSciNetGoogle Scholar
  12. 12.
    Hochbaum, D.S.: Efficient algorithms for the inverse spanning tree problem. Oper. Res. 51(5), 785–797 (2003)CrossRefMATHMathSciNetGoogle Scholar
  13. 13.
    Liu, L.C., Wang, Q.: Constrained inverse min–max spanning tree problems under the weighted Hamming distance. J. Glob. Optim. 43, 83–95 (2009)CrossRefMATHMathSciNetGoogle Scholar
  14. 14.
    Liu, L., Yao, E.: Inverse min-max spanning tree problem under the weighted sum-type Hamming distance. Lect. Notes Comput. Sci. 4614, 375–383 (2007)CrossRefMATHGoogle Scholar
  15. 15.
    Minoux, M.: Solving combinatorial problems with combined minmax–minsum objective and applications. Math. Program. (B) 45, 361–371 (1989)CrossRefMATHGoogle Scholar
  16. 16.
    Punnen, A.P.: On combined minmax–minsum optimization. Comput. Oper. Res. 21(6), 707–716 (1994)CrossRefMATHGoogle Scholar
  17. 17.
    Punnen, A.P., Nair, K.P.K.: An \(O(m \log n)\) algorithm for the max \(+\) sum spanning tree problem. Eur. J. Oper. Res. 89, 423–426 (1996)CrossRefMATHGoogle Scholar
  18. 18.
    Scheinerman, E.R.: Matgraph is a Matlab toolbox for simple graphs. http://www.ams.jhu.edu/~ers/matgraph/
  19. 19.
    Schuler, S., Ebenbauer, C., Allgöwer, F.: \(l_0\)-system gain and \(l_1\)-optimal control. In: Proceedings of the 18th IFAC World Congress, pp. 9230C–9235 (2011)Google Scholar
  20. 20.
    Sokkalingam, P.T., Ahuja, R.K., Orlin, J.B.: Solving inverse spanning tree problems through network flow techniques. Oper. Res. 47(2), 291–298 (1999)CrossRefMATHMathSciNetGoogle Scholar
  21. 21.
    Yang, X.G., Zhang, J.Z.: Some inverse min–max network problems under weighted \(l_1\) and \(l_\infty \) norms with bound constraints on changes. J. Comb. Optim. 13, 123–135 (2007)CrossRefMATHMathSciNetGoogle Scholar
  22. 22.
    Zhang, B., Zhang, J., He, Y.: Constrained inverse minimum spanning tree problems under the Bottleneck-type Hamming distance. J. Glob. Optim. 34(3), 467–474 (2006)CrossRefMATHMathSciNetGoogle Scholar
  23. 23.
    Zhang, J.Z., Liu, Z., Ma, Z.: On the inverse problem of minimum spanning tree with partition constraints. Math. Methods Oper. Res. 44, 171–187 (1996)CrossRefMATHMathSciNetGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2017

Authors and Affiliations

  • Xiucui Guan
    • 1
  • Xinyan He
    • 2
  • Panos M. Pardalos
    • 3
    • 5
  • Binwu Zhang
    • 4
  1. 1.Department of MathematicsSoutheast UniversityNanjingChina
  2. 2.Zhenjiang High SchoolZhenjiangChina
  3. 3.Department of Industrial and Systems Engineering, Center for Applied OptimizationUniversity of FloridaGainesvilleUSA
  4. 4.Department of Mathematics and Physics, Changzhou CampusHohai UniversityChangzhouChina
  5. 5.LATNAHigher School of EconomicsMoscowRussia

Personalised recommendations